{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:Q3B66THHQ5RXZHXSCJTCKSPNDH","short_pith_number":"pith:Q3B66THH","canonical_record":{"source":{"id":"1310.3438","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-10-13T00:12:25Z","cross_cats_sorted":["cs.DC","math.OC"],"title_canon_sha256":"9643283bcb7ef4e14c3448dc5fb9254889b17e0a8242d5d20dfaf041d93f3477","abstract_canon_sha256":"2f45610a5e36e8263852953a66404ce1a91481d7cb5bb37043b732b56e2db80f"},"schema_version":"1.0"},"canonical_sha256":"86c3ef4ce787637c9ef212662549ed19c3dc2ed435acdc80f5677f1b28841c4d","source":{"kind":"arxiv","id":"1310.3438","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.3438","created_at":"2026-05-18T03:10:35Z"},{"alias_kind":"arxiv_version","alias_value":"1310.3438v1","created_at":"2026-05-18T03:10:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.3438","created_at":"2026-05-18T03:10:35Z"},{"alias_kind":"pith_short_12","alias_value":"Q3B66THHQ5RX","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"Q3B66THHQ5RXZHXS","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"Q3B66THH","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:Q3B66THHQ5RXZHXSCJTCKSPNDH","target":"record","payload":{"canonical_record":{"source":{"id":"1310.3438","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-10-13T00:12:25Z","cross_cats_sorted":["cs.DC","math.OC"],"title_canon_sha256":"9643283bcb7ef4e14c3448dc5fb9254889b17e0a8242d5d20dfaf041d93f3477","abstract_canon_sha256":"2f45610a5e36e8263852953a66404ce1a91481d7cb5bb37043b732b56e2db80f"},"schema_version":"1.0"},"canonical_sha256":"86c3ef4ce787637c9ef212662549ed19c3dc2ed435acdc80f5677f1b28841c4d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:35.737381Z","signature_b64":"DOGQetjIYiNFeHJazF4ocSR7GUiPVKIZlss7ivZP0KZNycbvGNM0po8qtVDSmYYMnQrsp5pwF65TYuLNBFM8DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86c3ef4ce787637c9ef212662549ed19c3dc2ed435acdc80f5677f1b28841c4d","last_reissued_at":"2026-05-18T03:10:35.736796Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:35.736796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.3438","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:10:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XnRV7Bco/8250PahA3w6vKbW+2tB8c0hPc2Fa/Y4SVMXqhAE8HWsoNHGGi7oNBFEjiDClxcmdTZ0v0zdsQr9CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T03:07:18.191516Z"},"content_sha256":"68158449b725466854a274393d23d89f383a2f51d7ad07fa26b9ec57c4eae4f0","schema_version":"1.0","event_id":"sha256:68158449b725466854a274393d23d89f383a2f51d7ad07fa26b9ec57c4eae4f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:Q3B66THHQ5RXZHXSCJTCKSPNDH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Optimal Probabilities in Stochastic Coordinate Descent Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.OC"],"primary_cat":"stat.ML","authors_text":"Martin Tak\\'a\\v{c}, Peter Richt\\'arik","submitted_at":"2013-10-13T00:12:25Z","abstract_excerpt":"We propose and analyze a new parallel coordinate descent method---`NSync---in which at each iteration a random subset of coordinates is updated, in parallel, allowing for the subsets to be chosen non-uniformly. We derive convergence rates under a strong convexity assumption, and comment on how to assign probabilities to the sets to optimize the bound. The complexity and practical performance of the method can outperform its uniform variant by an order of magnitude. Surprisingly, the strategy of updating a single randomly selected coordinate per iteration---with optimal probabilities---may requ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.3438","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:10:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lljNRWdiSUOwd8JDHqus6RrEMILjCVhB9LNgO74tNcmeJkawo5ZlfjpZV6AsP3aUD4/rIP2Vqmc6qVdBV15yCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T03:07:18.192231Z"},"content_sha256":"d81a7a837cc3080d6a11c6703c936c56fcefd3a81e5d3f2f77a5dcf54a46a8a5","schema_version":"1.0","event_id":"sha256:d81a7a837cc3080d6a11c6703c936c56fcefd3a81e5d3f2f77a5dcf54a46a8a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q3B66THHQ5RXZHXSCJTCKSPNDH/bundle.json","state_url":"https://pith.science/pith/Q3B66THHQ5RXZHXSCJTCKSPNDH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q3B66THHQ5RXZHXSCJTCKSPNDH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-24T03:07:18Z","links":{"resolver":"https://pith.science/pith/Q3B66THHQ5RXZHXSCJTCKSPNDH","bundle":"https://pith.science/pith/Q3B66THHQ5RXZHXSCJTCKSPNDH/bundle.json","state":"https://pith.science/pith/Q3B66THHQ5RXZHXSCJTCKSPNDH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q3B66THHQ5RXZHXSCJTCKSPNDH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:Q3B66THHQ5RXZHXSCJTCKSPNDH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2f45610a5e36e8263852953a66404ce1a91481d7cb5bb37043b732b56e2db80f","cross_cats_sorted":["cs.DC","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-10-13T00:12:25Z","title_canon_sha256":"9643283bcb7ef4e14c3448dc5fb9254889b17e0a8242d5d20dfaf041d93f3477"},"schema_version":"1.0","source":{"id":"1310.3438","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.3438","created_at":"2026-05-18T03:10:35Z"},{"alias_kind":"arxiv_version","alias_value":"1310.3438v1","created_at":"2026-05-18T03:10:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.3438","created_at":"2026-05-18T03:10:35Z"},{"alias_kind":"pith_short_12","alias_value":"Q3B66THHQ5RX","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"Q3B66THHQ5RXZHXS","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"Q3B66THH","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:d81a7a837cc3080d6a11c6703c936c56fcefd3a81e5d3f2f77a5dcf54a46a8a5","target":"graph","created_at":"2026-05-18T03:10:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We propose and analyze a new parallel coordinate descent method---`NSync---in which at each iteration a random subset of coordinates is updated, in parallel, allowing for the subsets to be chosen non-uniformly. We derive convergence rates under a strong convexity assumption, and comment on how to assign probabilities to the sets to optimize the bound. The complexity and practical performance of the method can outperform its uniform variant by an order of magnitude. Surprisingly, the strategy of updating a single randomly selected coordinate per iteration---with optimal probabilities---may requ","authors_text":"Martin Tak\\'a\\v{c}, Peter Richt\\'arik","cross_cats":["cs.DC","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-10-13T00:12:25Z","title":"On Optimal Probabilities in Stochastic Coordinate Descent Methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.3438","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:68158449b725466854a274393d23d89f383a2f51d7ad07fa26b9ec57c4eae4f0","target":"record","created_at":"2026-05-18T03:10:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2f45610a5e36e8263852953a66404ce1a91481d7cb5bb37043b732b56e2db80f","cross_cats_sorted":["cs.DC","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-10-13T00:12:25Z","title_canon_sha256":"9643283bcb7ef4e14c3448dc5fb9254889b17e0a8242d5d20dfaf041d93f3477"},"schema_version":"1.0","source":{"id":"1310.3438","kind":"arxiv","version":1}},"canonical_sha256":"86c3ef4ce787637c9ef212662549ed19c3dc2ed435acdc80f5677f1b28841c4d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86c3ef4ce787637c9ef212662549ed19c3dc2ed435acdc80f5677f1b28841c4d","first_computed_at":"2026-05-18T03:10:35.736796Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:35.736796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DOGQetjIYiNFeHJazF4ocSR7GUiPVKIZlss7ivZP0KZNycbvGNM0po8qtVDSmYYMnQrsp5pwF65TYuLNBFM8DA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:35.737381Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.3438","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68158449b725466854a274393d23d89f383a2f51d7ad07fa26b9ec57c4eae4f0","sha256:d81a7a837cc3080d6a11c6703c936c56fcefd3a81e5d3f2f77a5dcf54a46a8a5"],"state_sha256":"af2fb8d220f901a4da12d6bb79414dcdf80a11d7f66d88a88b82186c48534fac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iguw9QnA8RAOsSK6sInhOiLpmeQ3aT4y0GFknDcw7JRmBocqZlkjiaIXJhSWlgNhV9u+lVuuLdcCE+2bPWh5Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T03:07:18.196095Z","bundle_sha256":"e1cd633e01b4db46117241e756e482d4c6d11744d2ef5203b16fa3ee2b78e88e"}}