{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:R6OCXSKGGDMLS6AKV6BBK37XMV","short_pith_number":"pith:R6OCXSKG","canonical_record":{"source":{"id":"1609.06287","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-20T18:45:06Z","cross_cats_sorted":[],"title_canon_sha256":"3b111aca099a99ffcdddecdb13f62bf78c1859672d591c0ce314d1028ad5a546","abstract_canon_sha256":"d2aac6226971512c7d52801627f24345c92404d15ff92e9775ade8ed73c7e893"},"schema_version":"1.0"},"canonical_sha256":"8f9c2bc94630d8b9780aaf82156ff7657abee863ac181c9470adcb9d880c0101","source":{"kind":"arxiv","id":"1609.06287","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.06287","created_at":"2026-05-18T00:36:47Z"},{"alias_kind":"arxiv_version","alias_value":"1609.06287v3","created_at":"2026-05-18T00:36:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.06287","created_at":"2026-05-18T00:36:47Z"},{"alias_kind":"pith_short_12","alias_value":"R6OCXSKGGDML","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"R6OCXSKGGDMLS6AK","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"R6OCXSKG","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:R6OCXSKGGDMLS6AKV6BBK37XMV","target":"record","payload":{"canonical_record":{"source":{"id":"1609.06287","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-20T18:45:06Z","cross_cats_sorted":[],"title_canon_sha256":"3b111aca099a99ffcdddecdb13f62bf78c1859672d591c0ce314d1028ad5a546","abstract_canon_sha256":"d2aac6226971512c7d52801627f24345c92404d15ff92e9775ade8ed73c7e893"},"schema_version":"1.0"},"canonical_sha256":"8f9c2bc94630d8b9780aaf82156ff7657abee863ac181c9470adcb9d880c0101","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:47.849108Z","signature_b64":"mM8grG0dEL44xpQx0HVZT3oN2bSQzNkAWNgpTD2vec1+WXGoeV8qRX4bUpcync38hBZTTn4l/dzPhhtrVk/DAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f9c2bc94630d8b9780aaf82156ff7657abee863ac181c9470adcb9d880c0101","last_reissued_at":"2026-05-18T00:36:47.848571Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:47.848571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.06287","source_version":3,"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-18T00:36:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"avAwDsoRJcfuc/0gfIFI+vjJ+bUk8boIdv0r8T7PvMvHnbAN+vA763xQFqjA3BMND3KuISnH7ARgHgL+x0aPBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:29:33.823274Z"},"content_sha256":"d2dc659b300e59e935214ee842810ccd42154d34e00412fb94da41d715afac84","schema_version":"1.0","event_id":"sha256:d2dc659b300e59e935214ee842810ccd42154d34e00412fb94da41d715afac84"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:R6OCXSKGGDMLS6AKV6BBK37XMV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Lagrangian Methods for Network Resource Allocation","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":"2016-09-20T18:45:06Z","abstract_excerpt":"Motivated by a variety of applications in control engineering and information sciences, we study network resource allocation problems where the goal is to optimally allocate a fixed amount of resource over a network of nodes. In these problems, due to the large scale of the network and complicated inter-connections between nodes, any solution must be implemented in parallel and based only on local data resulting in a need for distributed algorithms. In this paper, we propose a novel distributed Lagrangian method, which requires only local computation and communication. Our focus is to understa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.06287","kind":"arxiv","version":3},"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-18T00:36:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p4Y9YkML012hdhtJ1s84VKak7YPc3bxAERhlUW2xOqbeMlhd16OrTVuwnqk5FGfplYht34GzeZP4X12C3Hd1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:29:33.824012Z"},"content_sha256":"008851109d4a8539ff79829ac93ef312184beff53af348981cc497a2145f4617","schema_version":"1.0","event_id":"sha256:008851109d4a8539ff79829ac93ef312184beff53af348981cc497a2145f4617"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R6OCXSKGGDMLS6AKV6BBK37XMV/bundle.json","state_url":"https://pith.science/pith/R6OCXSKGGDMLS6AKV6BBK37XMV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R6OCXSKGGDMLS6AKV6BBK37XMV/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-31T23:29:33Z","links":{"resolver":"https://pith.science/pith/R6OCXSKGGDMLS6AKV6BBK37XMV","bundle":"https://pith.science/pith/R6OCXSKGGDMLS6AKV6BBK37XMV/bundle.json","state":"https://pith.science/pith/R6OCXSKGGDMLS6AKV6BBK37XMV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R6OCXSKGGDMLS6AKV6BBK37XMV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:R6OCXSKGGDMLS6AKV6BBK37XMV","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":"d2aac6226971512c7d52801627f24345c92404d15ff92e9775ade8ed73c7e893","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-20T18:45:06Z","title_canon_sha256":"3b111aca099a99ffcdddecdb13f62bf78c1859672d591c0ce314d1028ad5a546"},"schema_version":"1.0","source":{"id":"1609.06287","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.06287","created_at":"2026-05-18T00:36:47Z"},{"alias_kind":"arxiv_version","alias_value":"1609.06287v3","created_at":"2026-05-18T00:36:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.06287","created_at":"2026-05-18T00:36:47Z"},{"alias_kind":"pith_short_12","alias_value":"R6OCXSKGGDML","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"R6OCXSKGGDMLS6AK","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"R6OCXSKG","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:008851109d4a8539ff79829ac93ef312184beff53af348981cc497a2145f4617","target":"graph","created_at":"2026-05-18T00:36:47Z","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":"Motivated by a variety of applications in control engineering and information sciences, we study network resource allocation problems where the goal is to optimally allocate a fixed amount of resource over a network of nodes. In these problems, due to the large scale of the network and complicated inter-connections between nodes, any solution must be implemented in parallel and based only on local data resulting in a need for distributed algorithms. In this paper, we propose a novel distributed Lagrangian method, which requires only local computation and communication. Our focus is to understa","authors_text":"Carolyn L. Beck, Thinh T. Doan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-20T18:45:06Z","title":"Distributed Lagrangian Methods for Network Resource Allocation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.06287","kind":"arxiv","version":3},"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:d2dc659b300e59e935214ee842810ccd42154d34e00412fb94da41d715afac84","target":"record","created_at":"2026-05-18T00:36:47Z","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":"d2aac6226971512c7d52801627f24345c92404d15ff92e9775ade8ed73c7e893","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-20T18:45:06Z","title_canon_sha256":"3b111aca099a99ffcdddecdb13f62bf78c1859672d591c0ce314d1028ad5a546"},"schema_version":"1.0","source":{"id":"1609.06287","kind":"arxiv","version":3}},"canonical_sha256":"8f9c2bc94630d8b9780aaf82156ff7657abee863ac181c9470adcb9d880c0101","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f9c2bc94630d8b9780aaf82156ff7657abee863ac181c9470adcb9d880c0101","first_computed_at":"2026-05-18T00:36:47.848571Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:47.848571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mM8grG0dEL44xpQx0HVZT3oN2bSQzNkAWNgpTD2vec1+WXGoeV8qRX4bUpcync38hBZTTn4l/dzPhhtrVk/DAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:47.849108Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.06287","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d2dc659b300e59e935214ee842810ccd42154d34e00412fb94da41d715afac84","sha256:008851109d4a8539ff79829ac93ef312184beff53af348981cc497a2145f4617"],"state_sha256":"7f426c7dcfef292198b8552e2868062a5cd6d52144b385f65a165a45f50f74c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2g7xpJLCtj659pp58GDdI2jWvGgf4TY2x39C5roiH683rfhwfmDGgROMugg2gbU3GF+L46uZVLBJLXe4fPYUBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:29:33.828641Z","bundle_sha256":"83f9854d69a799be0086a9409545b08392d59767f3bdd6caecc55135b6906b15"}}