{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:POLDWXVHYE32YYJH32BEG55EH2","short_pith_number":"pith:POLDWXVH","canonical_record":{"source":{"id":"1506.05485","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-17T20:26:50Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"a3f6d1a4c062419a86466266094afdfaf86f83e616f3b7871fc403d72202fb56","abstract_canon_sha256":"7b8077ead07ea05e58c6ddf5fa3ff026e04de529a027d75667d8c2215b25df92"},"schema_version":"1.0"},"canonical_sha256":"7b963b5ea7c137ac6127de824377a43eb285df05ed1fa33af7bece1d9c644737","source":{"kind":"arxiv","id":"1506.05485","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.05485","created_at":"2026-05-18T01:42:47Z"},{"alias_kind":"arxiv_version","alias_value":"1506.05485v2","created_at":"2026-05-18T01:42:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.05485","created_at":"2026-05-18T01:42:47Z"},{"alias_kind":"pith_short_12","alias_value":"POLDWXVHYE32","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"POLDWXVHYE32YYJH","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"POLDWXVH","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:POLDWXVHYE32YYJH32BEG55EH2","target":"record","payload":{"canonical_record":{"source":{"id":"1506.05485","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-17T20:26:50Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"a3f6d1a4c062419a86466266094afdfaf86f83e616f3b7871fc403d72202fb56","abstract_canon_sha256":"7b8077ead07ea05e58c6ddf5fa3ff026e04de529a027d75667d8c2215b25df92"},"schema_version":"1.0"},"canonical_sha256":"7b963b5ea7c137ac6127de824377a43eb285df05ed1fa33af7bece1d9c644737","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:42:47.273370Z","signature_b64":"tFn9ESerC3qqm5OGooAHAN37zGtRa4Rw9pvkTQ62Wv+wP9vj466GDG2qYi+d19kW6gOBf+3SSYkeneQeauQuAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b963b5ea7c137ac6127de824377a43eb285df05ed1fa33af7bece1d9c644737","last_reissued_at":"2026-05-18T01:42:47.272677Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:42:47.272677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.05485","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:42:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k2sNRarV6ZO0aAjFJ6coAtjLhopkEuphde9R6RvyiRgK/JjB3g2faBY5PwIX7c6lGZIOygGb/B/O5IIs3OQVDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:44:19.153720Z"},"content_sha256":"655b49c46e1b41ff6cb297f971063237d9ac9e9cf0e705f70b553c785fb99bfc","schema_version":"1.0","event_id":"sha256:655b49c46e1b41ff6cb297f971063237d9ac9e9cf0e705f70b553c785fb99bfc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:POLDWXVHYE32YYJH32BEG55EH2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Convergence Analysis of Asynchronous Distributed Quadratic Programming via Dual Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Kooktae Lee, Raktim Bhattacharya","submitted_at":"2015-06-17T20:26:50Z","abstract_excerpt":"In this paper, we analyze the convergence as well as the rate of convergence of asynchronous distributed quadratic programming (QP) with dual decomposition technique. In general, distributed optimization requires synchronization of data at each iteration step due to the interdependency of data. This synchronization latency may incur a large amount of waiting time caused by an idle process during computation. We aim to attack this synchronization penalty in distributed QP problems by implementing asynchronous update of dual variable. The price to pay for adopting asynchronous computing algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.05485","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:42:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ArMOBaaz/xVc2CQccMTP5KsrC1dAbLkOnkBetJkUY9fnKrzTxAzcViFqt/fxP0gkRy/DDirpH3rYExJMf1I8DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:44:19.154069Z"},"content_sha256":"c29c518fd77e9c2d019c2694bf37224ee4a72b7905ef3667fdb8785f14b24763","schema_version":"1.0","event_id":"sha256:c29c518fd77e9c2d019c2694bf37224ee4a72b7905ef3667fdb8785f14b24763"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/POLDWXVHYE32YYJH32BEG55EH2/bundle.json","state_url":"https://pith.science/pith/POLDWXVHYE32YYJH32BEG55EH2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/POLDWXVHYE32YYJH32BEG55EH2/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-28T08:44:19Z","links":{"resolver":"https://pith.science/pith/POLDWXVHYE32YYJH32BEG55EH2","bundle":"https://pith.science/pith/POLDWXVHYE32YYJH32BEG55EH2/bundle.json","state":"https://pith.science/pith/POLDWXVHYE32YYJH32BEG55EH2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/POLDWXVHYE32YYJH32BEG55EH2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:POLDWXVHYE32YYJH32BEG55EH2","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":"7b8077ead07ea05e58c6ddf5fa3ff026e04de529a027d75667d8c2215b25df92","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-17T20:26:50Z","title_canon_sha256":"a3f6d1a4c062419a86466266094afdfaf86f83e616f3b7871fc403d72202fb56"},"schema_version":"1.0","source":{"id":"1506.05485","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.05485","created_at":"2026-05-18T01:42:47Z"},{"alias_kind":"arxiv_version","alias_value":"1506.05485v2","created_at":"2026-05-18T01:42:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.05485","created_at":"2026-05-18T01:42:47Z"},{"alias_kind":"pith_short_12","alias_value":"POLDWXVHYE32","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"POLDWXVHYE32YYJH","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"POLDWXVH","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:c29c518fd77e9c2d019c2694bf37224ee4a72b7905ef3667fdb8785f14b24763","target":"graph","created_at":"2026-05-18T01:42:47Z","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 this paper, we analyze the convergence as well as the rate of convergence of asynchronous distributed quadratic programming (QP) with dual decomposition technique. In general, distributed optimization requires synchronization of data at each iteration step due to the interdependency of data. This synchronization latency may incur a large amount of waiting time caused by an idle process during computation. We aim to attack this synchronization penalty in distributed QP problems by implementing asynchronous update of dual variable. The price to pay for adopting asynchronous computing algorith","authors_text":"Kooktae Lee, Raktim Bhattacharya","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-17T20:26:50Z","title":"On the Convergence Analysis of Asynchronous Distributed Quadratic Programming via Dual Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.05485","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:655b49c46e1b41ff6cb297f971063237d9ac9e9cf0e705f70b553c785fb99bfc","target":"record","created_at":"2026-05-18T01:42:47Z","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":"7b8077ead07ea05e58c6ddf5fa3ff026e04de529a027d75667d8c2215b25df92","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-17T20:26:50Z","title_canon_sha256":"a3f6d1a4c062419a86466266094afdfaf86f83e616f3b7871fc403d72202fb56"},"schema_version":"1.0","source":{"id":"1506.05485","kind":"arxiv","version":2}},"canonical_sha256":"7b963b5ea7c137ac6127de824377a43eb285df05ed1fa33af7bece1d9c644737","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7b963b5ea7c137ac6127de824377a43eb285df05ed1fa33af7bece1d9c644737","first_computed_at":"2026-05-18T01:42:47.272677Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:42:47.272677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tFn9ESerC3qqm5OGooAHAN37zGtRa4Rw9pvkTQ62Wv+wP9vj466GDG2qYi+d19kW6gOBf+3SSYkeneQeauQuAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:42:47.273370Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.05485","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:655b49c46e1b41ff6cb297f971063237d9ac9e9cf0e705f70b553c785fb99bfc","sha256:c29c518fd77e9c2d019c2694bf37224ee4a72b7905ef3667fdb8785f14b24763"],"state_sha256":"5cb4c12b7e662725e0f6701d5f7d0c8be6432c90b6acdde8f72161b8809ffd4c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nvPnekQxemdxd/jx6qWGOuKKPb9K5xkiMwxFNM1LM7rzkZKgduRWIkrIcSPceP9SBpq1s8Ubn1EjGRYl1JuNAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T08:44:19.156050Z","bundle_sha256":"2e38f00fdac326da7e0105697b44addbbc2dcaeb9430c6669d6fa745ed8a3b82"}}