{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:6KEXDJMLZX27RR34BG32HQXW3E","short_pith_number":"pith:6KEXDJML","canonical_record":{"source":{"id":"1211.7309","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-11-30T16:58:43Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"1102875ab97c93dd7e3a2b35f5d2606779a1ac8404647d2498b8b62017ad4496","abstract_canon_sha256":"6436e26862b95826a06277d99a60aa08314e3727e254e6809fa5350e461aaab1"},"schema_version":"1.0"},"canonical_sha256":"f28971a58bcdf5f8c77c09b7a3c2f6d915e5476ec5705fdc0a7f0d989cf36d16","source":{"kind":"arxiv","id":"1211.7309","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.7309","created_at":"2026-05-18T03:39:30Z"},{"alias_kind":"arxiv_version","alias_value":"1211.7309v1","created_at":"2026-05-18T03:39:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.7309","created_at":"2026-05-18T03:39:30Z"},{"alias_kind":"pith_short_12","alias_value":"6KEXDJMLZX27","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6KEXDJMLZX27RR34","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6KEXDJML","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:6KEXDJMLZX27RR34BG32HQXW3E","target":"record","payload":{"canonical_record":{"source":{"id":"1211.7309","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-11-30T16:58:43Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"1102875ab97c93dd7e3a2b35f5d2606779a1ac8404647d2498b8b62017ad4496","abstract_canon_sha256":"6436e26862b95826a06277d99a60aa08314e3727e254e6809fa5350e461aaab1"},"schema_version":"1.0"},"canonical_sha256":"f28971a58bcdf5f8c77c09b7a3c2f6d915e5476ec5705fdc0a7f0d989cf36d16","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:30.950049Z","signature_b64":"uT5t82/TuAq5m8Ffc8xOslvI2yXDCVRbhbdfPo87rmFkryc/FFwk7JsSNQuqppxCMHF8a5mnFtkTDY5G6RJABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f28971a58bcdf5f8c77c09b7a3c2f6d915e5476ec5705fdc0a7f0d989cf36d16","last_reissued_at":"2026-05-18T03:39:30.949369Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:30.949369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.7309","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-18T03:39:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qmzUvlZ1dcnuSFao3AEMWwV2q9e+zuYDjHOD2j8DHgOntY4Sq7JRSnHKkx24kJkwvj/UH2UY13P6cTUK53kGCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:18:37.384641Z"},"content_sha256":"ae002bba338d352bbe381af022345a5a8a6917b20d5bc2a3aaf0b7e25fe746ae","schema_version":"1.0","event_id":"sha256:ae002bba338d352bbe381af022345a5a8a6917b20d5bc2a3aaf0b7e25fe746ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:6KEXDJMLZX27RR34BG32HQXW3E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Optimization via Adaptive Regularization for Large Problems with Separable Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DC","authors_text":"Arye Nehorai, Elad Gilboa, Peng Yang, Phani Chavali","submitted_at":"2012-11-30T16:58:43Z","abstract_excerpt":"Many practical applications require solving an optimization over large and high-dimensional data sets, which makes these problems hard to solve and prohibitively time consuming. In this paper, we propose a parallel distributed algorithm that uses an adaptive regularizer (PDAR) to solve a joint optimization problem with separable constraints. The regularizer is adaptive and depends on the step size between iterations and the iteration number. We show theoretical converge of our algorithm to an optimal solution, and use a multi-agent three-bin resource allocation example to illustrate the effect"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.7309","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-18T03:39:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BZimzDQ2mEr4z4gLNhwBpE6CJjkHWBzVhPcZupBcT3pMBUaD37a9QbMee5/P0J+4mC2q7DDx8HZa4gilRqghAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:18:37.385357Z"},"content_sha256":"22e321ec948f330646e59a3dbfa263250e9be4ec393a823806007a679e4cc97d","schema_version":"1.0","event_id":"sha256:22e321ec948f330646e59a3dbfa263250e9be4ec393a823806007a679e4cc97d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6KEXDJMLZX27RR34BG32HQXW3E/bundle.json","state_url":"https://pith.science/pith/6KEXDJMLZX27RR34BG32HQXW3E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6KEXDJMLZX27RR34BG32HQXW3E/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-26T22:18:37Z","links":{"resolver":"https://pith.science/pith/6KEXDJMLZX27RR34BG32HQXW3E","bundle":"https://pith.science/pith/6KEXDJMLZX27RR34BG32HQXW3E/bundle.json","state":"https://pith.science/pith/6KEXDJMLZX27RR34BG32HQXW3E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6KEXDJMLZX27RR34BG32HQXW3E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:6KEXDJMLZX27RR34BG32HQXW3E","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":"6436e26862b95826a06277d99a60aa08314e3727e254e6809fa5350e461aaab1","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-11-30T16:58:43Z","title_canon_sha256":"1102875ab97c93dd7e3a2b35f5d2606779a1ac8404647d2498b8b62017ad4496"},"schema_version":"1.0","source":{"id":"1211.7309","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.7309","created_at":"2026-05-18T03:39:30Z"},{"alias_kind":"arxiv_version","alias_value":"1211.7309v1","created_at":"2026-05-18T03:39:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.7309","created_at":"2026-05-18T03:39:30Z"},{"alias_kind":"pith_short_12","alias_value":"6KEXDJMLZX27","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6KEXDJMLZX27RR34","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6KEXDJML","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:22e321ec948f330646e59a3dbfa263250e9be4ec393a823806007a679e4cc97d","target":"graph","created_at":"2026-05-18T03:39:30Z","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":"Many practical applications require solving an optimization over large and high-dimensional data sets, which makes these problems hard to solve and prohibitively time consuming. In this paper, we propose a parallel distributed algorithm that uses an adaptive regularizer (PDAR) to solve a joint optimization problem with separable constraints. The regularizer is adaptive and depends on the step size between iterations and the iteration number. We show theoretical converge of our algorithm to an optimal solution, and use a multi-agent three-bin resource allocation example to illustrate the effect","authors_text":"Arye Nehorai, Elad Gilboa, Peng Yang, Phani Chavali","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-11-30T16:58:43Z","title":"Distributed Optimization via Adaptive Regularization for Large Problems with Separable Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.7309","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:ae002bba338d352bbe381af022345a5a8a6917b20d5bc2a3aaf0b7e25fe746ae","target":"record","created_at":"2026-05-18T03:39:30Z","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":"6436e26862b95826a06277d99a60aa08314e3727e254e6809fa5350e461aaab1","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-11-30T16:58:43Z","title_canon_sha256":"1102875ab97c93dd7e3a2b35f5d2606779a1ac8404647d2498b8b62017ad4496"},"schema_version":"1.0","source":{"id":"1211.7309","kind":"arxiv","version":1}},"canonical_sha256":"f28971a58bcdf5f8c77c09b7a3c2f6d915e5476ec5705fdc0a7f0d989cf36d16","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f28971a58bcdf5f8c77c09b7a3c2f6d915e5476ec5705fdc0a7f0d989cf36d16","first_computed_at":"2026-05-18T03:39:30.949369Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:39:30.949369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uT5t82/TuAq5m8Ffc8xOslvI2yXDCVRbhbdfPo87rmFkryc/FFwk7JsSNQuqppxCMHF8a5mnFtkTDY5G6RJABA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:39:30.950049Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.7309","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae002bba338d352bbe381af022345a5a8a6917b20d5bc2a3aaf0b7e25fe746ae","sha256:22e321ec948f330646e59a3dbfa263250e9be4ec393a823806007a679e4cc97d"],"state_sha256":"b1688b436921328d13fa3a94bad57aeae8a136dda68eedb63dccfc079feb41fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GmSI37n16Sacy6NkIUT1qQFNv4k1DSdBkfeb+Dwibbl/evCrpd4JGhScHlOh4FfBfi48xu56F3NWkNVsOW6LCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T22:18:37.389072Z","bundle_sha256":"9503fb7237bf856be36905697e7a0b09a08160a3a5c8bb22348bb2fd728cdd88"}}