{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:J6455SMY3H56FCQMYCVH6NTZ37","short_pith_number":"pith:J6455SMY","canonical_record":{"source":{"id":"1902.01856","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-05T00:40:26Z","cross_cats_sorted":["cs.DC","cs.LG","stat.ML"],"title_canon_sha256":"e93c4f2d239ee99af6b16941e687ae9733c31f8902d4102cfb5f3c432a090673","abstract_canon_sha256":"b6c323a9cc89fd233f65e604f036610e7080cc984784cd991a771ac5ecab919b"},"schema_version":"1.0"},"canonical_sha256":"4fb9dec998d9fbe28a0cc0aa7f3679dfc6e5bca3f95e304a5450c7a966dd9f52","source":{"kind":"arxiv","id":"1902.01856","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.01856","created_at":"2026-05-17T23:54:38Z"},{"alias_kind":"arxiv_version","alias_value":"1902.01856v1","created_at":"2026-05-17T23:54:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01856","created_at":"2026-05-17T23:54:38Z"},{"alias_kind":"pith_short_12","alias_value":"J6455SMY3H56","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"J6455SMY3H56FCQM","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"J6455SMY","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:J6455SMY3H56FCQMYCVH6NTZ37","target":"record","payload":{"canonical_record":{"source":{"id":"1902.01856","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-05T00:40:26Z","cross_cats_sorted":["cs.DC","cs.LG","stat.ML"],"title_canon_sha256":"e93c4f2d239ee99af6b16941e687ae9733c31f8902d4102cfb5f3c432a090673","abstract_canon_sha256":"b6c323a9cc89fd233f65e604f036610e7080cc984784cd991a771ac5ecab919b"},"schema_version":"1.0"},"canonical_sha256":"4fb9dec998d9fbe28a0cc0aa7f3679dfc6e5bca3f95e304a5450c7a966dd9f52","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:38.582392Z","signature_b64":"QutaBvTqrf7uxO6FLSBzDa1k/wdi8Uy/HPef7KNr3LEEZo1KEiK+ZSvZ48tgo+QmxFxjlYmOooNxtnA3VIx5Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4fb9dec998d9fbe28a0cc0aa7f3679dfc6e5bca3f95e304a5450c7a966dd9f52","last_reissued_at":"2026-05-17T23:54:38.581875Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:38.581875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.01856","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-17T23:54:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uJmr2qIgokP65aF/hTj/em9xvJuZxNR5Z9F+YI+2t4uqVdD8AzY3A71VZs9vysS7YKCGb7RN83ITdbCxXBCHAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:16:13.478524Z"},"content_sha256":"5a8817720ba1d793e6a1b5537d8cba35e5c9b5c42867067d8652daf28b743b5d","schema_version":"1.0","event_id":"sha256:5a8817720ba1d793e6a1b5537d8cba35e5c9b5c42867067d8652daf28b743b5d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:J6455SMY3H56FCQMYCVH6NTZ37","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asynchronous Delay-Aware Accelerated Proximal Coordinate Descent for Nonconvex Nonsmooth Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Ehsan Kazemi, Liqiang Wang","submitted_at":"2019-02-05T00:40:26Z","abstract_excerpt":"Nonconvex and nonsmooth problems have recently attracted considerable attention in machine learning. However, developing efficient methods for the nonconvex and nonsmooth optimization problems with certain performance guarantee remains a challenge. Proximal coordinate descent (PCD) has been widely used for solving optimization problems, but the knowledge of PCD methods in the nonconvex setting is very limited. On the other hand, the asynchronous proximal coordinate descent (APCD) recently have received much attention in order to solve large-scale problems. However, the accelerated variants of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01856","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-17T23:54:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QkJnLzfP7NgAFNW0cL4pb37gn1rrNc2DOE4qbVp49OO39cylzO6Xe1cEb9suMRnRFDW3YDqo9gpbabU4vUjgBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:16:13.479218Z"},"content_sha256":"05f5fb6d203bb5e047709339e10c97391a49868d5324a43bef776e9f5cf17ef6","schema_version":"1.0","event_id":"sha256:05f5fb6d203bb5e047709339e10c97391a49868d5324a43bef776e9f5cf17ef6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J6455SMY3H56FCQMYCVH6NTZ37/bundle.json","state_url":"https://pith.science/pith/J6455SMY3H56FCQMYCVH6NTZ37/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J6455SMY3H56FCQMYCVH6NTZ37/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-28T18:16:13Z","links":{"resolver":"https://pith.science/pith/J6455SMY3H56FCQMYCVH6NTZ37","bundle":"https://pith.science/pith/J6455SMY3H56FCQMYCVH6NTZ37/bundle.json","state":"https://pith.science/pith/J6455SMY3H56FCQMYCVH6NTZ37/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J6455SMY3H56FCQMYCVH6NTZ37/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:J6455SMY3H56FCQMYCVH6NTZ37","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":"b6c323a9cc89fd233f65e604f036610e7080cc984784cd991a771ac5ecab919b","cross_cats_sorted":["cs.DC","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-05T00:40:26Z","title_canon_sha256":"e93c4f2d239ee99af6b16941e687ae9733c31f8902d4102cfb5f3c432a090673"},"schema_version":"1.0","source":{"id":"1902.01856","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.01856","created_at":"2026-05-17T23:54:38Z"},{"alias_kind":"arxiv_version","alias_value":"1902.01856v1","created_at":"2026-05-17T23:54:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01856","created_at":"2026-05-17T23:54:38Z"},{"alias_kind":"pith_short_12","alias_value":"J6455SMY3H56","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"J6455SMY3H56FCQM","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"J6455SMY","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:05f5fb6d203bb5e047709339e10c97391a49868d5324a43bef776e9f5cf17ef6","target":"graph","created_at":"2026-05-17T23:54:38Z","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":"Nonconvex and nonsmooth problems have recently attracted considerable attention in machine learning. However, developing efficient methods for the nonconvex and nonsmooth optimization problems with certain performance guarantee remains a challenge. Proximal coordinate descent (PCD) has been widely used for solving optimization problems, but the knowledge of PCD methods in the nonconvex setting is very limited. On the other hand, the asynchronous proximal coordinate descent (APCD) recently have received much attention in order to solve large-scale problems. However, the accelerated variants of ","authors_text":"Ehsan Kazemi, Liqiang Wang","cross_cats":["cs.DC","cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-05T00:40:26Z","title":"Asynchronous Delay-Aware Accelerated Proximal Coordinate Descent for Nonconvex Nonsmooth Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01856","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:5a8817720ba1d793e6a1b5537d8cba35e5c9b5c42867067d8652daf28b743b5d","target":"record","created_at":"2026-05-17T23:54:38Z","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":"b6c323a9cc89fd233f65e604f036610e7080cc984784cd991a771ac5ecab919b","cross_cats_sorted":["cs.DC","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-05T00:40:26Z","title_canon_sha256":"e93c4f2d239ee99af6b16941e687ae9733c31f8902d4102cfb5f3c432a090673"},"schema_version":"1.0","source":{"id":"1902.01856","kind":"arxiv","version":1}},"canonical_sha256":"4fb9dec998d9fbe28a0cc0aa7f3679dfc6e5bca3f95e304a5450c7a966dd9f52","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4fb9dec998d9fbe28a0cc0aa7f3679dfc6e5bca3f95e304a5450c7a966dd9f52","first_computed_at":"2026-05-17T23:54:38.581875Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:38.581875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QutaBvTqrf7uxO6FLSBzDa1k/wdi8Uy/HPef7KNr3LEEZo1KEiK+ZSvZ48tgo+QmxFxjlYmOooNxtnA3VIx5Dg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:38.582392Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.01856","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a8817720ba1d793e6a1b5537d8cba35e5c9b5c42867067d8652daf28b743b5d","sha256:05f5fb6d203bb5e047709339e10c97391a49868d5324a43bef776e9f5cf17ef6"],"state_sha256":"ce6965a08dfc73ca16ff9b914f0270a0ad752c123c2ea2117350d9bb8b84db0d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BrG/qhXTLHPzIImkJIFH8adVLv5wWDhd/b5MjfssX02lEZ0HbZRaM06CPjFMwqh85+MuaGe6p+y9vAgM/NONAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T18:16:13.483063Z","bundle_sha256":"214903c9b45b74da561a5fdaf6249225b3776c581b8a6bc7e014c74ce64486a0"}}