{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7LWP3L2OHJSDJFZED5QTVLKVTO","short_pith_number":"pith:7LWP3L2O","canonical_record":{"source":{"id":"1706.05441","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-16T22:07:05Z","cross_cats_sorted":["cs.DC","cs.MA"],"title_canon_sha256":"dccd6cfb9b6d02963fae45431838d114a6680b6055ba5d9ec5f9e89c6714b0d4","abstract_canon_sha256":"b5753c19337aab3525add3bdab8052b12e3cd18272d761102da5c6890150624d"},"schema_version":"1.0"},"canonical_sha256":"faecfdaf4e3a643497241f613aad559bbad167c9116cb06a8c671fa73b4af5f9","source":{"kind":"arxiv","id":"1706.05441","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.05441","created_at":"2026-05-17T23:58:14Z"},{"alias_kind":"arxiv_version","alias_value":"1706.05441v2","created_at":"2026-05-17T23:58:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05441","created_at":"2026-05-17T23:58:14Z"},{"alias_kind":"pith_short_12","alias_value":"7LWP3L2OHJSD","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7LWP3L2OHJSDJFZE","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7LWP3L2O","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7LWP3L2OHJSDJFZED5QTVLKVTO","target":"record","payload":{"canonical_record":{"source":{"id":"1706.05441","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-16T22:07:05Z","cross_cats_sorted":["cs.DC","cs.MA"],"title_canon_sha256":"dccd6cfb9b6d02963fae45431838d114a6680b6055ba5d9ec5f9e89c6714b0d4","abstract_canon_sha256":"b5753c19337aab3525add3bdab8052b12e3cd18272d761102da5c6890150624d"},"schema_version":"1.0"},"canonical_sha256":"faecfdaf4e3a643497241f613aad559bbad167c9116cb06a8c671fa73b4af5f9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:14.952671Z","signature_b64":"RBViMRInvacjarfEWr10raAtR2RsoY9KouLOMhHUQ3HKpHMvV0co23T9dbAD3LivdBkysGatoy2igFEGIzBvCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"faecfdaf4e3a643497241f613aad559bbad167c9116cb06a8c671fa73b4af5f9","last_reissued_at":"2026-05-17T23:58:14.952045Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:14.952045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.05441","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-17T23:58:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O0RhNuM/L8LBuLiECpnZUD5nQF1HfMzuzpxAzrh6OahbXZfv/vjSzNVK8WAiQbL6mWcHpOSNx/B3bLS00mC9AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:29:08.405152Z"},"content_sha256":"e33cab680bd77ae7938bee75204307420bafcb3e2040cc4d26ccbacb9408a4e9","schema_version":"1.0","event_id":"sha256:e33cab680bd77ae7938bee75204307420bafcb3e2040cc4d26ccbacb9408a4e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7LWP3L2OHJSDJFZED5QTVLKVTO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Convergence Rates for Distributed Resource Allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.MA"],"primary_cat":"math.OC","authors_text":"Alex Olshevsky, Angelia Nedi\\'c, Wei Shi","submitted_at":"2017-06-16T22:07:05Z","abstract_excerpt":"In this paper, we develop a class of decentralized algorithms for solving a convex resource allocation problem in a network of $n$ agents, where the agent objectives are decoupled while the resource constraints are coupled. The agents communicate over a connected undirected graph, and they want to collaboratively determine a solution to the overall network problem, while each agent only communicates with its neighbors. We first study the connection between the decentralized resource allocation problem and the decentralized consensus optimization problem. Then, using a class of algorithms for s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05441","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-17T23:58:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Yzfpf4VVTmxBGLEdL4ZdTzYNFrqyx33GVgnVOBEmLdGYwvB47t9H/hdKEgVTSnnAq+zg/azTej+Bb/n09FbBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:29:08.405527Z"},"content_sha256":"8c920dccd3b73f0f9d90dabe2bf55e73c3e79ef144cac96289556894bd183bbc","schema_version":"1.0","event_id":"sha256:8c920dccd3b73f0f9d90dabe2bf55e73c3e79ef144cac96289556894bd183bbc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7LWP3L2OHJSDJFZED5QTVLKVTO/bundle.json","state_url":"https://pith.science/pith/7LWP3L2OHJSDJFZED5QTVLKVTO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7LWP3L2OHJSDJFZED5QTVLKVTO/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-28T10:29:08Z","links":{"resolver":"https://pith.science/pith/7LWP3L2OHJSDJFZED5QTVLKVTO","bundle":"https://pith.science/pith/7LWP3L2OHJSDJFZED5QTVLKVTO/bundle.json","state":"https://pith.science/pith/7LWP3L2OHJSDJFZED5QTVLKVTO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7LWP3L2OHJSDJFZED5QTVLKVTO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7LWP3L2OHJSDJFZED5QTVLKVTO","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":"b5753c19337aab3525add3bdab8052b12e3cd18272d761102da5c6890150624d","cross_cats_sorted":["cs.DC","cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-16T22:07:05Z","title_canon_sha256":"dccd6cfb9b6d02963fae45431838d114a6680b6055ba5d9ec5f9e89c6714b0d4"},"schema_version":"1.0","source":{"id":"1706.05441","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.05441","created_at":"2026-05-17T23:58:14Z"},{"alias_kind":"arxiv_version","alias_value":"1706.05441v2","created_at":"2026-05-17T23:58:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05441","created_at":"2026-05-17T23:58:14Z"},{"alias_kind":"pith_short_12","alias_value":"7LWP3L2OHJSD","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7LWP3L2OHJSDJFZE","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7LWP3L2O","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:8c920dccd3b73f0f9d90dabe2bf55e73c3e79ef144cac96289556894bd183bbc","target":"graph","created_at":"2026-05-17T23:58:14Z","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 develop a class of decentralized algorithms for solving a convex resource allocation problem in a network of $n$ agents, where the agent objectives are decoupled while the resource constraints are coupled. The agents communicate over a connected undirected graph, and they want to collaboratively determine a solution to the overall network problem, while each agent only communicates with its neighbors. We first study the connection between the decentralized resource allocation problem and the decentralized consensus optimization problem. Then, using a class of algorithms for s","authors_text":"Alex Olshevsky, Angelia Nedi\\'c, Wei Shi","cross_cats":["cs.DC","cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-16T22:07:05Z","title":"Improved Convergence Rates for Distributed Resource Allocation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05441","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:e33cab680bd77ae7938bee75204307420bafcb3e2040cc4d26ccbacb9408a4e9","target":"record","created_at":"2026-05-17T23:58:14Z","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":"b5753c19337aab3525add3bdab8052b12e3cd18272d761102da5c6890150624d","cross_cats_sorted":["cs.DC","cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-16T22:07:05Z","title_canon_sha256":"dccd6cfb9b6d02963fae45431838d114a6680b6055ba5d9ec5f9e89c6714b0d4"},"schema_version":"1.0","source":{"id":"1706.05441","kind":"arxiv","version":2}},"canonical_sha256":"faecfdaf4e3a643497241f613aad559bbad167c9116cb06a8c671fa73b4af5f9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"faecfdaf4e3a643497241f613aad559bbad167c9116cb06a8c671fa73b4af5f9","first_computed_at":"2026-05-17T23:58:14.952045Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:14.952045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RBViMRInvacjarfEWr10raAtR2RsoY9KouLOMhHUQ3HKpHMvV0co23T9dbAD3LivdBkysGatoy2igFEGIzBvCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:14.952671Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.05441","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e33cab680bd77ae7938bee75204307420bafcb3e2040cc4d26ccbacb9408a4e9","sha256:8c920dccd3b73f0f9d90dabe2bf55e73c3e79ef144cac96289556894bd183bbc"],"state_sha256":"3e9a21611819764c6477c62060421d866dc9539f2939d6223864850dbbc4e8d2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"19cgIQwgeYnmyjRIXYHPUJxXNGB10b9Bdc3horC06gqYt5RBgY1pkheJWhcJl1tdcLzamxwr65oQcPCJuHSdDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:29:08.407666Z","bundle_sha256":"19f2bd7b4e49097baf49952d04f025d2e71934190bf23d3ec8197e0b7558c342"}}