{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JNWL3GCTJH2423ME4G75SXBMTE","short_pith_number":"pith:JNWL3GCT","canonical_record":{"source":{"id":"1806.01600","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-05T10:25:58Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"916c1423d2aa0101ac87d9c3e5b8c6a36503ed6e3ee6c9cad1cf8a2ac7480dbd","abstract_canon_sha256":"c34b6f4b579f828acada5b895dc191a1cb2c58753ec46acc82fe60826e34ad30"},"schema_version":"1.0"},"canonical_sha256":"4b6cbd985349f5cd6d84e1bfd95c2c9914ccf6aaf2e8de842761146358f26f85","source":{"kind":"arxiv","id":"1806.01600","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.01600","created_at":"2026-05-18T00:10:44Z"},{"alias_kind":"arxiv_version","alias_value":"1806.01600v2","created_at":"2026-05-18T00:10:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01600","created_at":"2026-05-18T00:10:44Z"},{"alias_kind":"pith_short_12","alias_value":"JNWL3GCTJH24","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JNWL3GCTJH2423ME","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JNWL3GCT","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JNWL3GCTJH2423ME4G75SXBMTE","target":"record","payload":{"canonical_record":{"source":{"id":"1806.01600","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-05T10:25:58Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"916c1423d2aa0101ac87d9c3e5b8c6a36503ed6e3ee6c9cad1cf8a2ac7480dbd","abstract_canon_sha256":"c34b6f4b579f828acada5b895dc191a1cb2c58753ec46acc82fe60826e34ad30"},"schema_version":"1.0"},"canonical_sha256":"4b6cbd985349f5cd6d84e1bfd95c2c9914ccf6aaf2e8de842761146358f26f85","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:44.419153Z","signature_b64":"mLrAU2hp4zAA6gF7TiSpgNHD+RnAL4fZSTkBrJR3KG4hIV55QeAlK8YYdNoyIDj3RLQWGaBfw208wOaibZtbBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b6cbd985349f5cd6d84e1bfd95c2c9914ccf6aaf2e8de842761146358f26f85","last_reissued_at":"2026-05-18T00:10:44.418730Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:44.418730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.01600","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-18T00:10:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h/krhIpJLbiU6uIwxYHB5Iu1HVUHRYUw2AHgEo5ogYb8+Oy7q4kQINFz+ET7uq5R4GxlsbFBK41cK4aIwAGyAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T20:08:32.446494Z"},"content_sha256":"a90a0797534ef19ac5da1932a97cd4c44b40e55a03b91b0bf83326d3b2b19ee8","schema_version":"1.0","event_id":"sha256:a90a0797534ef19ac5da1932a97cd4c44b40e55a03b91b0bf83326d3b2b19ee8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JNWL3GCTJH2423ME4G75SXBMTE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerated Randomized Coordinate Descent Algorithms for Stochastic Optimization and Online Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Akshita Bhandari, Chandramani Singh","submitted_at":"2018-06-05T10:25:58Z","abstract_excerpt":"We propose accelerated randomized coordinate descent algorithms for stochastic optimization and online learning. Our algorithms have significantly less per-iteration complexity than the known accelerated gradient algorithms. The proposed algorithms for online learning have better regret performance than the known randomized online coordinate descent algorithms. Furthermore, the proposed algorithms for stochastic optimization exhibit as good convergence rates as the best known randomized coordinate descent algorithms. We also show simulation results to demonstrate performance of the proposed al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.01600","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-18T00:10:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eQ9Aid6T/a7bfOEZyaziN8g8rlP3DzcQ/liYN3XYCPtixLgwVHlUpEO1WmDfzaE+Sj3NUC4knyavQ96wr4LzDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T20:08:32.446846Z"},"content_sha256":"637f8044f86436f3af4a1dc77a046cdc3c6b0eb0902f2b47ca7d884d5aaf6b99","schema_version":"1.0","event_id":"sha256:637f8044f86436f3af4a1dc77a046cdc3c6b0eb0902f2b47ca7d884d5aaf6b99"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JNWL3GCTJH2423ME4G75SXBMTE/bundle.json","state_url":"https://pith.science/pith/JNWL3GCTJH2423ME4G75SXBMTE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JNWL3GCTJH2423ME4G75SXBMTE/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-06-22T20:08:32Z","links":{"resolver":"https://pith.science/pith/JNWL3GCTJH2423ME4G75SXBMTE","bundle":"https://pith.science/pith/JNWL3GCTJH2423ME4G75SXBMTE/bundle.json","state":"https://pith.science/pith/JNWL3GCTJH2423ME4G75SXBMTE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JNWL3GCTJH2423ME4G75SXBMTE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JNWL3GCTJH2423ME4G75SXBMTE","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":"c34b6f4b579f828acada5b895dc191a1cb2c58753ec46acc82fe60826e34ad30","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-05T10:25:58Z","title_canon_sha256":"916c1423d2aa0101ac87d9c3e5b8c6a36503ed6e3ee6c9cad1cf8a2ac7480dbd"},"schema_version":"1.0","source":{"id":"1806.01600","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.01600","created_at":"2026-05-18T00:10:44Z"},{"alias_kind":"arxiv_version","alias_value":"1806.01600v2","created_at":"2026-05-18T00:10:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01600","created_at":"2026-05-18T00:10:44Z"},{"alias_kind":"pith_short_12","alias_value":"JNWL3GCTJH24","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JNWL3GCTJH2423ME","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JNWL3GCT","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:637f8044f86436f3af4a1dc77a046cdc3c6b0eb0902f2b47ca7d884d5aaf6b99","target":"graph","created_at":"2026-05-18T00:10:44Z","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 accelerated randomized coordinate descent algorithms for stochastic optimization and online learning. Our algorithms have significantly less per-iteration complexity than the known accelerated gradient algorithms. The proposed algorithms for online learning have better regret performance than the known randomized online coordinate descent algorithms. Furthermore, the proposed algorithms for stochastic optimization exhibit as good convergence rates as the best known randomized coordinate descent algorithms. We also show simulation results to demonstrate performance of the proposed al","authors_text":"Akshita Bhandari, Chandramani Singh","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-05T10:25:58Z","title":"Accelerated Randomized Coordinate Descent Algorithms for Stochastic Optimization and Online Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.01600","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:a90a0797534ef19ac5da1932a97cd4c44b40e55a03b91b0bf83326d3b2b19ee8","target":"record","created_at":"2026-05-18T00:10:44Z","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":"c34b6f4b579f828acada5b895dc191a1cb2c58753ec46acc82fe60826e34ad30","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-05T10:25:58Z","title_canon_sha256":"916c1423d2aa0101ac87d9c3e5b8c6a36503ed6e3ee6c9cad1cf8a2ac7480dbd"},"schema_version":"1.0","source":{"id":"1806.01600","kind":"arxiv","version":2}},"canonical_sha256":"4b6cbd985349f5cd6d84e1bfd95c2c9914ccf6aaf2e8de842761146358f26f85","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b6cbd985349f5cd6d84e1bfd95c2c9914ccf6aaf2e8de842761146358f26f85","first_computed_at":"2026-05-18T00:10:44.418730Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:44.418730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mLrAU2hp4zAA6gF7TiSpgNHD+RnAL4fZSTkBrJR3KG4hIV55QeAlK8YYdNoyIDj3RLQWGaBfw208wOaibZtbBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:44.419153Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.01600","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a90a0797534ef19ac5da1932a97cd4c44b40e55a03b91b0bf83326d3b2b19ee8","sha256:637f8044f86436f3af4a1dc77a046cdc3c6b0eb0902f2b47ca7d884d5aaf6b99"],"state_sha256":"40927f1791d05ae328b71370395eae3cc0b53ac2fdb1e36f58c11afbf2806641"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dpdWMgj9Qc+2MeNLNRZ8VxMhFP23pw9JstMJ7Ki0w8xVpj/t15XUYCi8agDO1yea/NQ/ynvfgWp0dzCjTn8ZBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T20:08:32.448781Z","bundle_sha256":"7743cd01520fc262d863e7a26a7ad4ff7041b2fe08209a1fe7fbe25275d45af6"}}