{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZNO2ROF2HTDF4DPHREHEXXDN23","short_pith_number":"pith:ZNO2ROF2","schema_version":"1.0","canonical_sha256":"cb5da8b8ba3cc65e0de7890e4bdc6dd6ef5dcbebdc69c712d0abf8f23cf90860","source":{"kind":"arxiv","id":"1710.09001","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1710.09001","created_at":"2026-05-18T00:32:00.600997+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.09001v1","created_at":"2026-05-18T00:32:00.600997+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.09001","created_at":"2026-05-18T00:32:00.600997+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZNO2ROF2HTDF","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZNO2ROF2HTDF4DPH","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZNO2ROF2","created_at":"2026-05-18T12:31:59.375834+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZNO2ROF2HTDF4DPHREHEXXDN23","json":"https://pith.science/pith/ZNO2ROF2HTDF4DPHREHEXXDN23.json","graph_json":"https://pith.science/api/pith-number/ZNO2ROF2HTDF4DPHREHEXXDN23/graph.json","events_json":"https://pith.science/api/pith-number/ZNO2ROF2HTDF4DPHREHEXXDN23/events.json","paper":"https://pith.science/paper/ZNO2ROF2"},"agent_actions":{"view_html":"https://pith.science/pith/ZNO2ROF2HTDF4DPHREHEXXDN23","download_json":"https://pith.science/pith/ZNO2ROF2HTDF4DPHREHEXXDN23.json","view_paper":"https://pith.science/paper/ZNO2ROF2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.09001&json=true","fetch_graph":"https://pith.science/api/pith-number/ZNO2ROF2HTDF4DPHREHEXXDN23/graph.json","fetch_events":"https://pith.science/api/pith-number/ZNO2ROF2HTDF4DPHREHEXXDN23/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZNO2ROF2HTDF4DPHREHEXXDN23/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZNO2ROF2HTDF4DPHREHEXXDN23/action/storage_attestation","attest_author":"https://pith.science/pith/ZNO2ROF2HTDF4DPHREHEXXDN23/action/author_attestation","sign_citation":"https://pith.science/pith/ZNO2ROF2HTDF4DPHREHEXXDN23/action/citation_signature","submit_replication":"https://pith.science/pith/ZNO2ROF2HTDF4DPHREHEXXDN23/action/replication_record"}},"created_at":"2026-05-18T00:32:00.600997+00:00","updated_at":"2026-05-18T00:32:00.600997+00:00"}