{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:YQUE5LXATKU275TWNQKI6HCKAQ","short_pith_number":"pith:YQUE5LXA","canonical_record":{"source":{"id":"1104.1157","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-04-06T17:38:57Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"d084781b2e467c16704d6731fc2af85a6af6ee0bb369c0c40265d38a9736571b","abstract_canon_sha256":"acf66ab35258a4cb7878dfd2cc5c7d93328afab1b642c0e1e5844ab06856325b"},"schema_version":"1.0"},"canonical_sha256":"c4284eaee09aa9aff6766c148f1c4a041369da375471f0f08626eeb3835acafc","source":{"kind":"arxiv","id":"1104.1157","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.1157","created_at":"2026-05-18T04:24:53Z"},{"alias_kind":"arxiv_version","alias_value":"1104.1157v1","created_at":"2026-05-18T04:24:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.1157","created_at":"2026-05-18T04:24:53Z"},{"alias_kind":"pith_short_12","alias_value":"YQUE5LXATKU2","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YQUE5LXATKU275TW","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YQUE5LXA","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:YQUE5LXATKU275TWNQKI6HCKAQ","target":"record","payload":{"canonical_record":{"source":{"id":"1104.1157","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-04-06T17:38:57Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"d084781b2e467c16704d6731fc2af85a6af6ee0bb369c0c40265d38a9736571b","abstract_canon_sha256":"acf66ab35258a4cb7878dfd2cc5c7d93328afab1b642c0e1e5844ab06856325b"},"schema_version":"1.0"},"canonical_sha256":"c4284eaee09aa9aff6766c148f1c4a041369da375471f0f08626eeb3835acafc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:53.485282Z","signature_b64":"rlAcUlM0mD4TovwNGb+vSJgfLFg3X7EpftcBhVJ0AWp7D+vrN9Ra2jogG7eL6F/ZMUQThKgnFtdaPjzY04NgDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4284eaee09aa9aff6766c148f1c4a041369da375471f0f08626eeb3835acafc","last_reissued_at":"2026-05-18T04:24:53.484825Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:53.484825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.1157","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-18T04:24:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qOB2r5CvFrmKZgb/rfE/3Ad3i+57J1roozPnizSxwVQT28b6RU3UHYntXgKi6JgqpbYWdXg7GLycRLQddillAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:43:37.166413Z"},"content_sha256":"c99919b580cd45f22f84b68476bd6e238d0006f71ebff77050df141daab3ef4e","schema_version":"1.0","event_id":"sha256:c99919b580cd45f22f84b68476bd6e238d0006f71ebff77050df141daab3ef4e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:YQUE5LXATKU275TWNQKI6HCKAQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerated Dual Descent for Network Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"A. Jadbabaie, A. Ozdaglar, A. Ribeiro, M. Zargham","submitted_at":"2011-04-06T17:38:57Z","abstract_excerpt":"Dual descent methods are commonly used to solve network optimization problems because their implementation can be distributed through the network. However, their convergence rates are typically very slow. This paper introduces a family of dual descent algorithms that use approximate Newton directions to accelerate the convergence rate of conventional dual descent. These approximate directions can be computed using local information exchanges thereby retaining the benefits of distributed implementations. The approximate Newton directions are obtained through matrix splitting techniques and spar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.1157","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-18T04:24:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L5Zd3Rxqv3IKyMkbGZAJtQ0FhYL19oA3GG/ijANfqMsdL5+ubC+OOt/X/R7Zj4tcyIbAMdSPjjX4fyXihQRIBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:43:37.166796Z"},"content_sha256":"3ca56296e51b99217ac580a8bb2c53783e97222159bd9faf541119fdc1e1f421","schema_version":"1.0","event_id":"sha256:3ca56296e51b99217ac580a8bb2c53783e97222159bd9faf541119fdc1e1f421"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YQUE5LXATKU275TWNQKI6HCKAQ/bundle.json","state_url":"https://pith.science/pith/YQUE5LXATKU275TWNQKI6HCKAQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YQUE5LXATKU275TWNQKI6HCKAQ/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-23T15:43:37Z","links":{"resolver":"https://pith.science/pith/YQUE5LXATKU275TWNQKI6HCKAQ","bundle":"https://pith.science/pith/YQUE5LXATKU275TWNQKI6HCKAQ/bundle.json","state":"https://pith.science/pith/YQUE5LXATKU275TWNQKI6HCKAQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YQUE5LXATKU275TWNQKI6HCKAQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:YQUE5LXATKU275TWNQKI6HCKAQ","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":"acf66ab35258a4cb7878dfd2cc5c7d93328afab1b642c0e1e5844ab06856325b","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-04-06T17:38:57Z","title_canon_sha256":"d084781b2e467c16704d6731fc2af85a6af6ee0bb369c0c40265d38a9736571b"},"schema_version":"1.0","source":{"id":"1104.1157","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.1157","created_at":"2026-05-18T04:24:53Z"},{"alias_kind":"arxiv_version","alias_value":"1104.1157v1","created_at":"2026-05-18T04:24:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.1157","created_at":"2026-05-18T04:24:53Z"},{"alias_kind":"pith_short_12","alias_value":"YQUE5LXATKU2","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YQUE5LXATKU275TW","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YQUE5LXA","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:3ca56296e51b99217ac580a8bb2c53783e97222159bd9faf541119fdc1e1f421","target":"graph","created_at":"2026-05-18T04:24:53Z","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":"Dual descent methods are commonly used to solve network optimization problems because their implementation can be distributed through the network. However, their convergence rates are typically very slow. This paper introduces a family of dual descent algorithms that use approximate Newton directions to accelerate the convergence rate of conventional dual descent. These approximate directions can be computed using local information exchanges thereby retaining the benefits of distributed implementations. The approximate Newton directions are obtained through matrix splitting techniques and spar","authors_text":"A. Jadbabaie, A. Ozdaglar, A. Ribeiro, M. Zargham","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-04-06T17:38:57Z","title":"Accelerated Dual Descent for Network Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.1157","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:c99919b580cd45f22f84b68476bd6e238d0006f71ebff77050df141daab3ef4e","target":"record","created_at":"2026-05-18T04:24:53Z","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":"acf66ab35258a4cb7878dfd2cc5c7d93328afab1b642c0e1e5844ab06856325b","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-04-06T17:38:57Z","title_canon_sha256":"d084781b2e467c16704d6731fc2af85a6af6ee0bb369c0c40265d38a9736571b"},"schema_version":"1.0","source":{"id":"1104.1157","kind":"arxiv","version":1}},"canonical_sha256":"c4284eaee09aa9aff6766c148f1c4a041369da375471f0f08626eeb3835acafc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4284eaee09aa9aff6766c148f1c4a041369da375471f0f08626eeb3835acafc","first_computed_at":"2026-05-18T04:24:53.484825Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:24:53.484825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rlAcUlM0mD4TovwNGb+vSJgfLFg3X7EpftcBhVJ0AWp7D+vrN9Ra2jogG7eL6F/ZMUQThKgnFtdaPjzY04NgDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:24:53.485282Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.1157","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c99919b580cd45f22f84b68476bd6e238d0006f71ebff77050df141daab3ef4e","sha256:3ca56296e51b99217ac580a8bb2c53783e97222159bd9faf541119fdc1e1f421"],"state_sha256":"5b5619d1cf164cbf9be77394cd0dfcdd116f12c877fc6fb818749cf6bb903a9a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hBo28L6cI+hfk5NKECepCmnmnC2ORILa4MbKJxYvLQXp9jvfOY37H0KpOu0/VELwRyAFZxG/tKfb3jkoGRItBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T15:43:37.169410Z","bundle_sha256":"f3e501b9f642fec51425f6d5c44485789e6a69ba5b0952b4ca19350a464646f3"}}