{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZNO2ROF2HTDF4DPHREHEXXDN23","short_pith_number":"pith:ZNO2ROF2","canonical_record":{"source":{"id":"1710.09001","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-24T21:53:21Z","cross_cats_sorted":["cs.DC","cs.LG","cs.PF","math.IT"],"title_canon_sha256":"d99a49bb98590127442efbf061bde12e4636b6ee5fe89455bb055b47416de637","abstract_canon_sha256":"0ee7ba5914c38e172436593750070e2c12d0047812b5f39e5af4f91faa2ce728"},"schema_version":"1.0"},"canonical_sha256":"cb5da8b8ba3cc65e0de7890e4bdc6dd6ef5dcbebdc69c712d0abf8f23cf90860","source":{"kind":"arxiv","id":"1710.09001","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.09001","created_at":"2026-05-18T00:32:00Z"},{"alias_kind":"arxiv_version","alias_value":"1710.09001v1","created_at":"2026-05-18T00:32:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.09001","created_at":"2026-05-18T00:32:00Z"},{"alias_kind":"pith_short_12","alias_value":"ZNO2ROF2HTDF","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZNO2ROF2HTDF4DPH","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZNO2ROF2","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZNO2ROF2HTDF4DPHREHEXXDN23","target":"record","payload":{"canonical_record":{"source":{"id":"1710.09001","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-24T21:53:21Z","cross_cats_sorted":["cs.DC","cs.LG","cs.PF","math.IT"],"title_canon_sha256":"d99a49bb98590127442efbf061bde12e4636b6ee5fe89455bb055b47416de637","abstract_canon_sha256":"0ee7ba5914c38e172436593750070e2c12d0047812b5f39e5af4f91faa2ce728"},"schema_version":"1.0"},"canonical_sha256":"cb5da8b8ba3cc65e0de7890e4bdc6dd6ef5dcbebdc69c712d0abf8f23cf90860","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:00.601583Z","signature_b64":"YBxXVl34lkqQoCoAJxPFcx4tstkTFZNc1M+VOOlpuY8p/0g4RzDuLYtvBpbFSSHJ3oeYcYSnB6RbmiAmX+ZIBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb5da8b8ba3cc65e0de7890e4bdc6dd6ef5dcbebdc69c712d0abf8f23cf90860","last_reissued_at":"2026-05-18T00:32:00.600905Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:00.600905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.09001","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-18T00:32:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1uGy4lYAju6SE8LIihkogbckPLQzH/nj9QCt6eiF7+7OMQGjebT454Q/audLLZSgdHJiNpWzCiAkusO2d3wgCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:33:21.708022Z"},"content_sha256":"a4e5ce96b73f8d23bae61287d5c48626fc5a8b89210ef540083bd88607e270a5","schema_version":"1.0","event_id":"sha256:a4e5ce96b73f8d23bae61287d5c48626fc5a8b89210ef540083bd88607e270a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZNO2ROF2HTDF4DPHREHEXXDN23","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Sequential Approximation Framework for Coded Distributed Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG","cs.PF","math.IT"],"primary_cat":"cs.IT","authors_text":"Claire Tomlin, Jingge Zhu, Kannan Ramchandran, Vipul Gupta, Ye Pu","submitted_at":"2017-10-24T21:53:21Z","abstract_excerpt":"Building on the previous work of Lee et al. and Ferdinand et al. on coded computation, we propose a sequential approximation framework for solving optimization problems in a distributed manner. In a distributed computation system, latency caused by individual processors (\"stragglers\") usually causes a significant delay in the overall process. The proposed method is powered by a sequential computation scheme, which is designed specifically for systems with stragglers. This scheme has the desirable property that the user is guaranteed to receive useful (approximate) computation results whenever "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.09001","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-18T00:32:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2hx2qL+jk2XOnRbMCf42iTYmpAShLy97W1LKRuoTmKrRaJ6h3EaA4ZDNmXiBN08MCffcrJqqk8RrLbmrQy+TDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:33:21.708407Z"},"content_sha256":"31e9783aa07a850cfcef819b15065992b6832b144ee2547589657ac7607ba0b1","schema_version":"1.0","event_id":"sha256:31e9783aa07a850cfcef819b15065992b6832b144ee2547589657ac7607ba0b1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZNO2ROF2HTDF4DPHREHEXXDN23/bundle.json","state_url":"https://pith.science/pith/ZNO2ROF2HTDF4DPHREHEXXDN23/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZNO2ROF2HTDF4DPHREHEXXDN23/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-25T10:33:21Z","links":{"resolver":"https://pith.science/pith/ZNO2ROF2HTDF4DPHREHEXXDN23","bundle":"https://pith.science/pith/ZNO2ROF2HTDF4DPHREHEXXDN23/bundle.json","state":"https://pith.science/pith/ZNO2ROF2HTDF4DPHREHEXXDN23/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZNO2ROF2HTDF4DPHREHEXXDN23/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZNO2ROF2HTDF4DPHREHEXXDN23","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":"0ee7ba5914c38e172436593750070e2c12d0047812b5f39e5af4f91faa2ce728","cross_cats_sorted":["cs.DC","cs.LG","cs.PF","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-24T21:53:21Z","title_canon_sha256":"d99a49bb98590127442efbf061bde12e4636b6ee5fe89455bb055b47416de637"},"schema_version":"1.0","source":{"id":"1710.09001","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.09001","created_at":"2026-05-18T00:32:00Z"},{"alias_kind":"arxiv_version","alias_value":"1710.09001v1","created_at":"2026-05-18T00:32:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.09001","created_at":"2026-05-18T00:32:00Z"},{"alias_kind":"pith_short_12","alias_value":"ZNO2ROF2HTDF","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZNO2ROF2HTDF4DPH","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZNO2ROF2","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:31e9783aa07a850cfcef819b15065992b6832b144ee2547589657ac7607ba0b1","target":"graph","created_at":"2026-05-18T00:32:00Z","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":"Building on the previous work of Lee et al. and Ferdinand et al. on coded computation, we propose a sequential approximation framework for solving optimization problems in a distributed manner. In a distributed computation system, latency caused by individual processors (\"stragglers\") usually causes a significant delay in the overall process. The proposed method is powered by a sequential computation scheme, which is designed specifically for systems with stragglers. This scheme has the desirable property that the user is guaranteed to receive useful (approximate) computation results whenever ","authors_text":"Claire Tomlin, Jingge Zhu, Kannan Ramchandran, Vipul Gupta, Ye Pu","cross_cats":["cs.DC","cs.LG","cs.PF","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-24T21:53:21Z","title":"A Sequential Approximation Framework for Coded Distributed Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.09001","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:a4e5ce96b73f8d23bae61287d5c48626fc5a8b89210ef540083bd88607e270a5","target":"record","created_at":"2026-05-18T00:32:00Z","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":"0ee7ba5914c38e172436593750070e2c12d0047812b5f39e5af4f91faa2ce728","cross_cats_sorted":["cs.DC","cs.LG","cs.PF","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-24T21:53:21Z","title_canon_sha256":"d99a49bb98590127442efbf061bde12e4636b6ee5fe89455bb055b47416de637"},"schema_version":"1.0","source":{"id":"1710.09001","kind":"arxiv","version":1}},"canonical_sha256":"cb5da8b8ba3cc65e0de7890e4bdc6dd6ef5dcbebdc69c712d0abf8f23cf90860","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb5da8b8ba3cc65e0de7890e4bdc6dd6ef5dcbebdc69c712d0abf8f23cf90860","first_computed_at":"2026-05-18T00:32:00.600905Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:00.600905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YBxXVl34lkqQoCoAJxPFcx4tstkTFZNc1M+VOOlpuY8p/0g4RzDuLYtvBpbFSSHJ3oeYcYSnB6RbmiAmX+ZIBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:00.601583Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.09001","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4e5ce96b73f8d23bae61287d5c48626fc5a8b89210ef540083bd88607e270a5","sha256:31e9783aa07a850cfcef819b15065992b6832b144ee2547589657ac7607ba0b1"],"state_sha256":"2fc50602b5ec7a4ec718e570be0991054f8edcec300a6ec0e466fe53a1491a95"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zMaW8cTTH4QsifEL2FW4Hh+y0WwYDzhvKXsG0YfLxGE6Po0mLCc3383VR/604ZDKZvMFMG4HUkaHZFfQ0i0QDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T10:33:21.711840Z","bundle_sha256":"0fdd90c98dbd52bc724a29f1cfd00c249cd711f35e52a832ef14da62cceddead"}}