{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ESK7FNGGBCDTL4VECZJHFUTC2I","short_pith_number":"pith:ESK7FNGG","canonical_record":{"source":{"id":"1312.5799","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-20T03:00:15Z","cross_cats_sorted":["cs.DC","cs.NA","math.NA","stat.ML"],"title_canon_sha256":"eb405d01fdf2043c71dc888f1789b34555210b7ec2e6e2a76d2b0c7c38787f77","abstract_canon_sha256":"b6201f5312a35a48b2733ffe4dfcd34b4912c7e8c20e0fce1914de951ac2b33c"},"schema_version":"1.0"},"canonical_sha256":"2495f2b4c6088735f2a4165272d262d22b367aa2810e7a20d8117cc1a6569eff","source":{"kind":"arxiv","id":"1312.5799","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.5799","created_at":"2026-05-18T02:57:26Z"},{"alias_kind":"arxiv_version","alias_value":"1312.5799v2","created_at":"2026-05-18T02:57:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5799","created_at":"2026-05-18T02:57:26Z"},{"alias_kind":"pith_short_12","alias_value":"ESK7FNGGBCDT","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"ESK7FNGGBCDTL4VE","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"ESK7FNGG","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ESK7FNGGBCDTL4VECZJHFUTC2I","target":"record","payload":{"canonical_record":{"source":{"id":"1312.5799","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-20T03:00:15Z","cross_cats_sorted":["cs.DC","cs.NA","math.NA","stat.ML"],"title_canon_sha256":"eb405d01fdf2043c71dc888f1789b34555210b7ec2e6e2a76d2b0c7c38787f77","abstract_canon_sha256":"b6201f5312a35a48b2733ffe4dfcd34b4912c7e8c20e0fce1914de951ac2b33c"},"schema_version":"1.0"},"canonical_sha256":"2495f2b4c6088735f2a4165272d262d22b367aa2810e7a20d8117cc1a6569eff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:26.209592Z","signature_b64":"qt34RDbHhS/uIsMRPrIanXzNphm7anPccUuzqKVr6IhRcYEj8nCiZhi6O+3Ri15tst2UCNCDG9/hHayNWc4cDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2495f2b4c6088735f2a4165272d262d22b367aa2810e7a20d8117cc1a6569eff","last_reissued_at":"2026-05-18T02:57:26.209039Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:26.209039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.5799","source_version":2,"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-18T02:57:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1IWfI9zD/PsXdWwEQzN8OiS1JbTE4btn0N669NvkK0zoWMlxFRp1ARml5CIP0KDVUnB0R8kB3HHX5JTRsPHMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T02:10:39.674985Z"},"content_sha256":"f04a41071de166cff1e56986fa5ec051623a2a922d2dc39dba393a1cc5ef24ef","schema_version":"1.0","event_id":"sha256:f04a41071de166cff1e56986fa5ec051623a2a922d2dc39dba393a1cc5ef24ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ESK7FNGGBCDTL4VECZJHFUTC2I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerated, Parallel and Proximal Coordinate Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NA","math.NA","stat.ML"],"primary_cat":"math.OC","authors_text":"Olivier Fercoq, Peter Richt\\'arik","submitted_at":"2013-12-20T03:00:15Z","abstract_excerpt":"We propose a new stochastic coordinate descent method for minimizing the sum of convex functions each of which depends on a small number of coordinates only. Our method (APPROX) is simultaneously Accelerated, Parallel and PROXimal; this is the first time such a method is proposed. In the special case when the number of processors is equal to the number of coordinates, the method converges at the rate $2\\bar{\\omega}\\bar{L} R^2/(k+1)^2 $, where $k$ is the iteration counter, $\\bar{\\omega}$ is an average degree of separability of the loss function, $\\bar{L}$ is the average of Lipschitz constants a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.5799","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"},"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-18T02:57:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EUSaIvDLs6Zt++T1rv7Gdoz/F7z2MQ6n+wLC71AQORsUYaGWiodIpuHjsrCEWaRshi6q9qX34B+6S+vChqKODg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T02:10:39.675450Z"},"content_sha256":"fdf2f95defb59f2bf8775519cb430fdda9b9096bcfb2b3f83fa939bec4d05fbe","schema_version":"1.0","event_id":"sha256:fdf2f95defb59f2bf8775519cb430fdda9b9096bcfb2b3f83fa939bec4d05fbe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ESK7FNGGBCDTL4VECZJHFUTC2I/bundle.json","state_url":"https://pith.science/pith/ESK7FNGGBCDTL4VECZJHFUTC2I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ESK7FNGGBCDTL4VECZJHFUTC2I/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-24T02:10:39Z","links":{"resolver":"https://pith.science/pith/ESK7FNGGBCDTL4VECZJHFUTC2I","bundle":"https://pith.science/pith/ESK7FNGGBCDTL4VECZJHFUTC2I/bundle.json","state":"https://pith.science/pith/ESK7FNGGBCDTL4VECZJHFUTC2I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ESK7FNGGBCDTL4VECZJHFUTC2I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ESK7FNGGBCDTL4VECZJHFUTC2I","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":"b6201f5312a35a48b2733ffe4dfcd34b4912c7e8c20e0fce1914de951ac2b33c","cross_cats_sorted":["cs.DC","cs.NA","math.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-20T03:00:15Z","title_canon_sha256":"eb405d01fdf2043c71dc888f1789b34555210b7ec2e6e2a76d2b0c7c38787f77"},"schema_version":"1.0","source":{"id":"1312.5799","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.5799","created_at":"2026-05-18T02:57:26Z"},{"alias_kind":"arxiv_version","alias_value":"1312.5799v2","created_at":"2026-05-18T02:57:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5799","created_at":"2026-05-18T02:57:26Z"},{"alias_kind":"pith_short_12","alias_value":"ESK7FNGGBCDT","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"ESK7FNGGBCDTL4VE","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"ESK7FNGG","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:fdf2f95defb59f2bf8775519cb430fdda9b9096bcfb2b3f83fa939bec4d05fbe","target":"graph","created_at":"2026-05-18T02:57:26Z","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 a new stochastic coordinate descent method for minimizing the sum of convex functions each of which depends on a small number of coordinates only. Our method (APPROX) is simultaneously Accelerated, Parallel and PROXimal; this is the first time such a method is proposed. In the special case when the number of processors is equal to the number of coordinates, the method converges at the rate $2\\bar{\\omega}\\bar{L} R^2/(k+1)^2 $, where $k$ is the iteration counter, $\\bar{\\omega}$ is an average degree of separability of the loss function, $\\bar{L}$ is the average of Lipschitz constants a","authors_text":"Olivier Fercoq, Peter Richt\\'arik","cross_cats":["cs.DC","cs.NA","math.NA","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-20T03:00:15Z","title":"Accelerated, Parallel and Proximal Coordinate Descent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.5799","kind":"arxiv","version":2},"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:f04a41071de166cff1e56986fa5ec051623a2a922d2dc39dba393a1cc5ef24ef","target":"record","created_at":"2026-05-18T02:57:26Z","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":"b6201f5312a35a48b2733ffe4dfcd34b4912c7e8c20e0fce1914de951ac2b33c","cross_cats_sorted":["cs.DC","cs.NA","math.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-20T03:00:15Z","title_canon_sha256":"eb405d01fdf2043c71dc888f1789b34555210b7ec2e6e2a76d2b0c7c38787f77"},"schema_version":"1.0","source":{"id":"1312.5799","kind":"arxiv","version":2}},"canonical_sha256":"2495f2b4c6088735f2a4165272d262d22b367aa2810e7a20d8117cc1a6569eff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2495f2b4c6088735f2a4165272d262d22b367aa2810e7a20d8117cc1a6569eff","first_computed_at":"2026-05-18T02:57:26.209039Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:57:26.209039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qt34RDbHhS/uIsMRPrIanXzNphm7anPccUuzqKVr6IhRcYEj8nCiZhi6O+3Ri15tst2UCNCDG9/hHayNWc4cDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:57:26.209592Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.5799","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f04a41071de166cff1e56986fa5ec051623a2a922d2dc39dba393a1cc5ef24ef","sha256:fdf2f95defb59f2bf8775519cb430fdda9b9096bcfb2b3f83fa939bec4d05fbe"],"state_sha256":"7ca840484a178aa7ae9ec9d128eed9686de659aa69555703f8b618c29313daf5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8A+DI0Vpe2aMdpvVO53YEvHNjokLsV++h9/EI6UN/SjZlUtX9SQJYDnFoqNGM0g5ijO9Afeop+02YC0phcD5Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T02:10:39.679679Z","bundle_sha256":"cf7bcad8811bd149bb1942cb01af6971dd5a0caa7fc0dbcf71b3edb54803207c"}}