{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YNISKKPZBT5VSRPNREPDJZ54LY","short_pith_number":"pith:YNISKKPZ","schema_version":"1.0","canonical_sha256":"c3512529f90cfb5945ed891e34e7bc5e286dd9bb1fc06dcacf9de1f33cb4b65a","source":{"kind":"arxiv","id":"1708.03543","version":9},"attestation_state":"computed","paper":{"title":"Distributed Resource Allocation Over Dynamic Networks with Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Carolyn L. Beck, Thinh T. Doan","submitted_at":"2017-08-11T13:48:26Z","abstract_excerpt":"Motivated by broad applications in various fields of engineering, we study a network resource allocation problem where the goal is to optimally allocate a fixed quantity of resources over a network of nodes. We consider large scale networks with complex interconnection structures, thus any solution must be implemented in parallel and based only on local data resulting in a need for distributed algorithms. In this paper, we study a distributed Lagrangian method for such problems. By utilizing the so-called distributed subgradient methods to solve the dual problem, our approach eliminates the ne"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1708.03543","kind":"arxiv","version":9},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-11T13:48:26Z","cross_cats_sorted":[],"title_canon_sha256":"4a4687ecfabd9847948d1d429b46f405357491523cf90dec69dd8f171c70715c","abstract_canon_sha256":"a50d88867c5505f5fb03a42b0a93dff9fc1130fa8c32f3f0d67722884907a8b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:00.518582Z","signature_b64":"XyHwaph52DSITn283Dh/RzGsVqqFjF2E8FU2S00p9nKW6xH2AvPeCDfPDbpf0DLP2tglG1DKh1LQgKYHCN3EBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3512529f90cfb5945ed891e34e7bc5e286dd9bb1fc06dcacf9de1f33cb4b65a","last_reissued_at":"2026-05-18T00:09:00.517843Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:00.517843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Resource Allocation Over Dynamic Networks with Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Carolyn L. Beck, Thinh T. Doan","submitted_at":"2017-08-11T13:48:26Z","abstract_excerpt":"Motivated by broad applications in various fields of engineering, we study a network resource allocation problem where the goal is to optimally allocate a fixed quantity of resources over a network of nodes. We consider large scale networks with complex interconnection structures, thus any solution must be implemented in parallel and based only on local data resulting in a need for distributed algorithms. In this paper, we study a distributed Lagrangian method for such problems. By utilizing the so-called distributed subgradient methods to solve the dual problem, our approach eliminates the ne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.03543","kind":"arxiv","version":9},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1708.03543","created_at":"2026-05-18T00:09:00.517947+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.03543v9","created_at":"2026-05-18T00:09:00.517947+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.03543","created_at":"2026-05-18T00:09:00.517947+00:00"},{"alias_kind":"pith_short_12","alias_value":"YNISKKPZBT5V","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YNISKKPZBT5VSRPN","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YNISKKPZ","created_at":"2026-05-18T12:31:56.362134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YNISKKPZBT5VSRPNREPDJZ54LY","json":"https://pith.science/pith/YNISKKPZBT5VSRPNREPDJZ54LY.json","graph_json":"https://pith.science/api/pith-number/YNISKKPZBT5VSRPNREPDJZ54LY/graph.json","events_json":"https://pith.science/api/pith-number/YNISKKPZBT5VSRPNREPDJZ54LY/events.json","paper":"https://pith.science/paper/YNISKKPZ"},"agent_actions":{"view_html":"https://pith.science/pith/YNISKKPZBT5VSRPNREPDJZ54LY","download_json":"https://pith.science/pith/YNISKKPZBT5VSRPNREPDJZ54LY.json","view_paper":"https://pith.science/paper/YNISKKPZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.03543&json=true","fetch_graph":"https://pith.science/api/pith-number/YNISKKPZBT5VSRPNREPDJZ54LY/graph.json","fetch_events":"https://pith.science/api/pith-number/YNISKKPZBT5VSRPNREPDJZ54LY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YNISKKPZBT5VSRPNREPDJZ54LY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YNISKKPZBT5VSRPNREPDJZ54LY/action/storage_attestation","attest_author":"https://pith.science/pith/YNISKKPZBT5VSRPNREPDJZ54LY/action/author_attestation","sign_citation":"https://pith.science/pith/YNISKKPZBT5VSRPNREPDJZ54LY/action/citation_signature","submit_replication":"https://pith.science/pith/YNISKKPZBT5VSRPNREPDJZ54LY/action/replication_record"}},"created_at":"2026-05-18T00:09:00.517947+00:00","updated_at":"2026-05-18T00:09:00.517947+00:00"}