{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HDRF4HQJM5Z7AQESWY2SNORGXN","short_pith_number":"pith:HDRF4HQJ","canonical_record":{"source":{"id":"1312.4415","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-16T16:01:08Z","cross_cats_sorted":["cs.DC","cs.MA"],"title_canon_sha256":"ba504ad9ffce447f8b4f5adcbee0706fc187fc906c527cb497e8219f4320c323","abstract_canon_sha256":"8d03bc1ffa566fceec1b477c713ba9f92f5f466ac68e6e14551b3419cb7745cc"},"schema_version":"1.0"},"canonical_sha256":"38e25e1e096773f04092b63526ba26bb72b05f52b97c297b4a3f46647d095b26","source":{"kind":"arxiv","id":"1312.4415","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.4415","created_at":"2026-05-18T01:45:50Z"},{"alias_kind":"arxiv_version","alias_value":"1312.4415v1","created_at":"2026-05-18T01:45:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4415","created_at":"2026-05-18T01:45:50Z"},{"alias_kind":"pith_short_12","alias_value":"HDRF4HQJM5Z7","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HDRF4HQJM5Z7AQES","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HDRF4HQJ","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HDRF4HQJM5Z7AQESWY2SNORGXN","target":"record","payload":{"canonical_record":{"source":{"id":"1312.4415","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-16T16:01:08Z","cross_cats_sorted":["cs.DC","cs.MA"],"title_canon_sha256":"ba504ad9ffce447f8b4f5adcbee0706fc187fc906c527cb497e8219f4320c323","abstract_canon_sha256":"8d03bc1ffa566fceec1b477c713ba9f92f5f466ac68e6e14551b3419cb7745cc"},"schema_version":"1.0"},"canonical_sha256":"38e25e1e096773f04092b63526ba26bb72b05f52b97c297b4a3f46647d095b26","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:45:50.222481Z","signature_b64":"rP1Tv1aSQg5CxkZS0bUoVkXCr6hPE1CAwtAdLDoNEF04+mLl+mokwCZbEWek9kx45Zu+8ylmV0o8ZXeEjbZfAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38e25e1e096773f04092b63526ba26bb72b05f52b97c297b4a3f46647d095b26","last_reissued_at":"2026-05-18T01:45:50.222047Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:45:50.222047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.4415","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-18T01:45:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2YWKddgy5cU9YTq2lStd8jYd/6vav3+vCn8u09s+gRN25aos5g6fohEbFW8W0Y/I833OiUOEvJXdty1B5ihdAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T05:05:27.211111Z"},"content_sha256":"87dc40741d47917f183bf89f349a9453bdfd35286032057630bb6e37af9b8757","schema_version":"1.0","event_id":"sha256:87dc40741d47917f183bf89f349a9453bdfd35286032057630bb6e37af9b8757"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HDRF4HQJM5Z7AQESWY2SNORGXN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Penalty-Based Distributed Stochastic Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.MA"],"primary_cat":"math.OC","authors_text":"Ali H. Sayed, Zaid J. Towfic","submitted_at":"2013-12-16T16:01:08Z","abstract_excerpt":"In this work, we study the task of distributed optimization over a network of learners in which each learner possesses a convex cost function, a set of affine equality constraints, and a set of convex inequality constraints. We propose a fully-distributed adaptive diffusion algorithm based on penalty methods that allows the network to cooperatively optimize the global cost function, which is defined as the sum of the individual costs over the network, subject to all constraints. We show that when small constant step-sizes are employed, the expected distance between the optimal solution vector "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4415","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-18T01:45:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7kHhpdoWj+hum0AOWaSVanCVIALTAhBEYn6aSeuR6UacXOWqXHaY9vRmg0KPIIEood3D8SQmDO490M+1AqAPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T05:05:27.211463Z"},"content_sha256":"e2fd2f1bf31a08518974da92985cf1a6d8c051a6893eba01445c01965040b7ca","schema_version":"1.0","event_id":"sha256:e2fd2f1bf31a08518974da92985cf1a6d8c051a6893eba01445c01965040b7ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HDRF4HQJM5Z7AQESWY2SNORGXN/bundle.json","state_url":"https://pith.science/pith/HDRF4HQJM5Z7AQESWY2SNORGXN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HDRF4HQJM5Z7AQESWY2SNORGXN/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-29T05:05:27Z","links":{"resolver":"https://pith.science/pith/HDRF4HQJM5Z7AQESWY2SNORGXN","bundle":"https://pith.science/pith/HDRF4HQJM5Z7AQESWY2SNORGXN/bundle.json","state":"https://pith.science/pith/HDRF4HQJM5Z7AQESWY2SNORGXN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HDRF4HQJM5Z7AQESWY2SNORGXN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HDRF4HQJM5Z7AQESWY2SNORGXN","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":"8d03bc1ffa566fceec1b477c713ba9f92f5f466ac68e6e14551b3419cb7745cc","cross_cats_sorted":["cs.DC","cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-16T16:01:08Z","title_canon_sha256":"ba504ad9ffce447f8b4f5adcbee0706fc187fc906c527cb497e8219f4320c323"},"schema_version":"1.0","source":{"id":"1312.4415","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.4415","created_at":"2026-05-18T01:45:50Z"},{"alias_kind":"arxiv_version","alias_value":"1312.4415v1","created_at":"2026-05-18T01:45:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4415","created_at":"2026-05-18T01:45:50Z"},{"alias_kind":"pith_short_12","alias_value":"HDRF4HQJM5Z7","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HDRF4HQJM5Z7AQES","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HDRF4HQJ","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:e2fd2f1bf31a08518974da92985cf1a6d8c051a6893eba01445c01965040b7ca","target":"graph","created_at":"2026-05-18T01:45:50Z","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 work, we study the task of distributed optimization over a network of learners in which each learner possesses a convex cost function, a set of affine equality constraints, and a set of convex inequality constraints. We propose a fully-distributed adaptive diffusion algorithm based on penalty methods that allows the network to cooperatively optimize the global cost function, which is defined as the sum of the individual costs over the network, subject to all constraints. We show that when small constant step-sizes are employed, the expected distance between the optimal solution vector ","authors_text":"Ali H. Sayed, Zaid J. Towfic","cross_cats":["cs.DC","cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-16T16:01:08Z","title":"Adaptive Penalty-Based Distributed Stochastic Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4415","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:87dc40741d47917f183bf89f349a9453bdfd35286032057630bb6e37af9b8757","target":"record","created_at":"2026-05-18T01:45:50Z","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":"8d03bc1ffa566fceec1b477c713ba9f92f5f466ac68e6e14551b3419cb7745cc","cross_cats_sorted":["cs.DC","cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-16T16:01:08Z","title_canon_sha256":"ba504ad9ffce447f8b4f5adcbee0706fc187fc906c527cb497e8219f4320c323"},"schema_version":"1.0","source":{"id":"1312.4415","kind":"arxiv","version":1}},"canonical_sha256":"38e25e1e096773f04092b63526ba26bb72b05f52b97c297b4a3f46647d095b26","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"38e25e1e096773f04092b63526ba26bb72b05f52b97c297b4a3f46647d095b26","first_computed_at":"2026-05-18T01:45:50.222047Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:45:50.222047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rP1Tv1aSQg5CxkZS0bUoVkXCr6hPE1CAwtAdLDoNEF04+mLl+mokwCZbEWek9kx45Zu+8ylmV0o8ZXeEjbZfAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:45:50.222481Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.4415","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87dc40741d47917f183bf89f349a9453bdfd35286032057630bb6e37af9b8757","sha256:e2fd2f1bf31a08518974da92985cf1a6d8c051a6893eba01445c01965040b7ca"],"state_sha256":"736b946f6b9b3b72e95172dfd697137c2b8a45ff753d8094eda33fdc16b23347"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DFLVJX1mgEhZco31D94ZefNB7CAlq7Pxle0ootIsnASNY2OmSiP6jKu39eb9EDaG0n8CvGfEPNmU3ruNifBECA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T05:05:27.213242Z","bundle_sha256":"7c961319498c1f3de584f90e64cd0d15559a31608799c208b94f77522f908c93"}}