{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:F57AVE5MT6KOFCLGN7XAJ3PFYG","short_pith_number":"pith:F57AVE5M","canonical_record":{"source":{"id":"1610.07184","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-10-23T15:17:43Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"63b36eb35f85e4607215b2683f70afad336ec74cb0eaafc5b939607f9d8bbf4c","abstract_canon_sha256":"6b9d173889b2819237acf559e501aa4428b1d440785f5948db1173224a338bdc"},"schema_version":"1.0"},"canonical_sha256":"2f7e0a93ac9f94e289666fee04ede5c192b2f2d750c12243a6f054a1a365751e","source":{"kind":"arxiv","id":"1610.07184","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.07184","created_at":"2026-05-18T01:00:33Z"},{"alias_kind":"arxiv_version","alias_value":"1610.07184v2","created_at":"2026-05-18T01:00:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07184","created_at":"2026-05-18T01:00:33Z"},{"alias_kind":"pith_short_12","alias_value":"F57AVE5MT6KO","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"F57AVE5MT6KOFCLG","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"F57AVE5M","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:F57AVE5MT6KOFCLGN7XAJ3PFYG","target":"record","payload":{"canonical_record":{"source":{"id":"1610.07184","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-10-23T15:17:43Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"63b36eb35f85e4607215b2683f70afad336ec74cb0eaafc5b939607f9d8bbf4c","abstract_canon_sha256":"6b9d173889b2819237acf559e501aa4428b1d440785f5948db1173224a338bdc"},"schema_version":"1.0"},"canonical_sha256":"2f7e0a93ac9f94e289666fee04ede5c192b2f2d750c12243a6f054a1a365751e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:33.186029Z","signature_b64":"+TzUBkxWG30wYzvAHV9LBkaAIhAOqmZ4wsABih2D11M1uO5wfQEw6UDMzrGHeKmwTxoX9jmvw/KCO2eIwKciCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f7e0a93ac9f94e289666fee04ede5c192b2f2d750c12243a6f054a1a365751e","last_reissued_at":"2026-05-18T01:00:33.185451Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:33.185451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.07184","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-18T01:00:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B8dfvfStIXQK87XQXj+jLzPM9RiBOSJmhqPmt7xFESvb5Dfjp+fNn8f2MvqXS3X5HClx+GaFXfISOHuEqoANBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:35:26.676899Z"},"content_sha256":"de37c7522fd9e18a3db45826a9c88266a0fdc2b35b5658e414ba0b054f1f4359","schema_version":"1.0","event_id":"sha256:de37c7522fd9e18a3db45826a9c88266a0fdc2b35b5658e414ba0b054f1f4359"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:F57AVE5MT6KOFCLGN7XAJ3PFYG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hybrid-DCA: A Double Asynchronous Approach for Stochastic Dual Coordinate Ascent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DC","authors_text":"Jinbo Bi, Sanguthevar Rajasekaran, Soumitra Pal, Tianbao Yang, Tingyang Xu","submitted_at":"2016-10-23T15:17:43Z","abstract_excerpt":"In prior works, stochastic dual coordinate ascent (SDCA) has been parallelized in a multi-core environment where the cores communicate through shared memory, or in a multi-processor distributed memory environment where the processors communicate through message passing. In this paper, we propose a hybrid SDCA framework for multi-core clusters, the most common high performance computing environment that consists of multiple nodes each having multiple cores and its own shared memory. We distribute data across nodes where each node solves a local problem in an asynchronous parallel fashion on its"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07184","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-18T01:00:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EartZKp2gYaHxGLn7Grbe6AtDOwcICBJhYOtQkDicLGeKdnQfiLiCctHH/osk77Qag50AB3eEtJwaYq+P/rvAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:35:26.677253Z"},"content_sha256":"1f5fce7cce3da482814cee6eb7ad05d67861e898f201d3d7abe157b05940877c","schema_version":"1.0","event_id":"sha256:1f5fce7cce3da482814cee6eb7ad05d67861e898f201d3d7abe157b05940877c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F57AVE5MT6KOFCLGN7XAJ3PFYG/bundle.json","state_url":"https://pith.science/pith/F57AVE5MT6KOFCLGN7XAJ3PFYG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F57AVE5MT6KOFCLGN7XAJ3PFYG/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-03T19:35:26Z","links":{"resolver":"https://pith.science/pith/F57AVE5MT6KOFCLGN7XAJ3PFYG","bundle":"https://pith.science/pith/F57AVE5MT6KOFCLGN7XAJ3PFYG/bundle.json","state":"https://pith.science/pith/F57AVE5MT6KOFCLGN7XAJ3PFYG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F57AVE5MT6KOFCLGN7XAJ3PFYG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:F57AVE5MT6KOFCLGN7XAJ3PFYG","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":"6b9d173889b2819237acf559e501aa4428b1d440785f5948db1173224a338bdc","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-10-23T15:17:43Z","title_canon_sha256":"63b36eb35f85e4607215b2683f70afad336ec74cb0eaafc5b939607f9d8bbf4c"},"schema_version":"1.0","source":{"id":"1610.07184","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.07184","created_at":"2026-05-18T01:00:33Z"},{"alias_kind":"arxiv_version","alias_value":"1610.07184v2","created_at":"2026-05-18T01:00:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07184","created_at":"2026-05-18T01:00:33Z"},{"alias_kind":"pith_short_12","alias_value":"F57AVE5MT6KO","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"F57AVE5MT6KOFCLG","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"F57AVE5M","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:1f5fce7cce3da482814cee6eb7ad05d67861e898f201d3d7abe157b05940877c","target":"graph","created_at":"2026-05-18T01:00:33Z","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":"In prior works, stochastic dual coordinate ascent (SDCA) has been parallelized in a multi-core environment where the cores communicate through shared memory, or in a multi-processor distributed memory environment where the processors communicate through message passing. In this paper, we propose a hybrid SDCA framework for multi-core clusters, the most common high performance computing environment that consists of multiple nodes each having multiple cores and its own shared memory. We distribute data across nodes where each node solves a local problem in an asynchronous parallel fashion on its","authors_text":"Jinbo Bi, Sanguthevar Rajasekaran, Soumitra Pal, Tianbao Yang, Tingyang Xu","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-10-23T15:17:43Z","title":"Hybrid-DCA: A Double Asynchronous Approach for Stochastic Dual Coordinate Ascent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07184","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:de37c7522fd9e18a3db45826a9c88266a0fdc2b35b5658e414ba0b054f1f4359","target":"record","created_at":"2026-05-18T01:00:33Z","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":"6b9d173889b2819237acf559e501aa4428b1d440785f5948db1173224a338bdc","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-10-23T15:17:43Z","title_canon_sha256":"63b36eb35f85e4607215b2683f70afad336ec74cb0eaafc5b939607f9d8bbf4c"},"schema_version":"1.0","source":{"id":"1610.07184","kind":"arxiv","version":2}},"canonical_sha256":"2f7e0a93ac9f94e289666fee04ede5c192b2f2d750c12243a6f054a1a365751e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f7e0a93ac9f94e289666fee04ede5c192b2f2d750c12243a6f054a1a365751e","first_computed_at":"2026-05-18T01:00:33.185451Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:33.185451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+TzUBkxWG30wYzvAHV9LBkaAIhAOqmZ4wsABih2D11M1uO5wfQEw6UDMzrGHeKmwTxoX9jmvw/KCO2eIwKciCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:33.186029Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.07184","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de37c7522fd9e18a3db45826a9c88266a0fdc2b35b5658e414ba0b054f1f4359","sha256:1f5fce7cce3da482814cee6eb7ad05d67861e898f201d3d7abe157b05940877c"],"state_sha256":"d89c4710e71a203528ad66811896d6a3edab8be4163ebf442c7d274297edd11a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ml2O8ehnQHLznj7C1BXH+75ZeTKQz6P/NA4dHyjc4OG8M8Sr4J31l+b8lwUjXHxg9kwpPkGXEJPLZCQ9qkUFBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T19:35:26.679286Z","bundle_sha256":"70ef59870bb931aeebf089d2c29baf3a79bacc2fbcc1a47946f4fa529552314d"}}