{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SU2BFVBHLITRYVASBB6ZFJ35VY","short_pith_number":"pith:SU2BFVBH","canonical_record":{"source":{"id":"1702.08290","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-27T14:06:20Z","cross_cats_sorted":[],"title_canon_sha256":"a4e89aaccdc9807bac9041babe44c769c910a43d89bc65ce8441dc8f2a4660af","abstract_canon_sha256":"11bf17de66a1800df4fd47636e755a6a1e7dcbb4c761dac9b0e687fb4f1ab526"},"schema_version":"1.0"},"canonical_sha256":"953412d4275a271c5412087d92a77dae2fd0995883db764ac35ef06584e980d5","source":{"kind":"arxiv","id":"1702.08290","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08290","created_at":"2026-05-18T00:16:33Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08290v2","created_at":"2026-05-18T00:16:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08290","created_at":"2026-05-18T00:16:33Z"},{"alias_kind":"pith_short_12","alias_value":"SU2BFVBHLITR","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SU2BFVBHLITRYVAS","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SU2BFVBH","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SU2BFVBHLITRYVASBB6ZFJ35VY","target":"record","payload":{"canonical_record":{"source":{"id":"1702.08290","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-27T14:06:20Z","cross_cats_sorted":[],"title_canon_sha256":"a4e89aaccdc9807bac9041babe44c769c910a43d89bc65ce8441dc8f2a4660af","abstract_canon_sha256":"11bf17de66a1800df4fd47636e755a6a1e7dcbb4c761dac9b0e687fb4f1ab526"},"schema_version":"1.0"},"canonical_sha256":"953412d4275a271c5412087d92a77dae2fd0995883db764ac35ef06584e980d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:33.984630Z","signature_b64":"gFUUx8tBKz2y/ayZFTbneBOcBo1oGbj1bxbFNq6iJ+duVBPycKT+aTueyhymf2zjYu8N5VODXrqvym5BRnkaBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"953412d4275a271c5412087d92a77dae2fd0995883db764ac35ef06584e980d5","last_reissued_at":"2026-05-18T00:16:33.984023Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:33.984023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.08290","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-18T00:16:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wzeCyAo4WfO5yf534ruc7CNf0klTm0LGWkLxKOXYHdKXoKv51hZaDhvfONn3/Su/ikecsMni+j7GJcQZPE+JAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T16:51:28.740198Z"},"content_sha256":"e22c7742fc90952ec4d14533102f8d420bcdcb1b3b14077b28ae6776c3105dab","schema_version":"1.0","event_id":"sha256:e22c7742fc90952ec4d14533102f8d420bcdcb1b3b14077b28ae6776c3105dab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SU2BFVBHLITRYVASBB6ZFJ35VY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asynchronous Incremental Stochastic Dual Descent Algorithm for Network Resource Allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Amrit S. Bedi, Ketan Rajawat","submitted_at":"2017-02-27T14:06:20Z","abstract_excerpt":"Stochastic network optimization problems entail finding resource allocation policies that are optimum on an average but must be designed in an online fashion. Such problems are ubiquitous in communication networks, where resources such as energy and bandwidth are divided among nodes to satisfy certain long-term objectives. This paper proposes an asynchronous incremental dual decent resource allocation algorithm that utilizes delayed stochastic {gradients} for carrying out its updates. The proposed algorithm is well-suited to heterogeneous networks as it allows the computationally-challenged or"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08290","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-18T00:16:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DlJHJonJlozYP5uSwnAOzzTWhi8LjMbxMYXJcBfdQ9q43YSI1Ak+LyfIvjaEL33LyYLmhCi9wDWr5k8uBGVvBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T16:51:28.740577Z"},"content_sha256":"e6c53858ff302bedfed37266df26f4971a9a5ac1a1258725e41326217204baa5","schema_version":"1.0","event_id":"sha256:e6c53858ff302bedfed37266df26f4971a9a5ac1a1258725e41326217204baa5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SU2BFVBHLITRYVASBB6ZFJ35VY/bundle.json","state_url":"https://pith.science/pith/SU2BFVBHLITRYVASBB6ZFJ35VY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SU2BFVBHLITRYVASBB6ZFJ35VY/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-23T16:51:28Z","links":{"resolver":"https://pith.science/pith/SU2BFVBHLITRYVASBB6ZFJ35VY","bundle":"https://pith.science/pith/SU2BFVBHLITRYVASBB6ZFJ35VY/bundle.json","state":"https://pith.science/pith/SU2BFVBHLITRYVASBB6ZFJ35VY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SU2BFVBHLITRYVASBB6ZFJ35VY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SU2BFVBHLITRYVASBB6ZFJ35VY","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":"11bf17de66a1800df4fd47636e755a6a1e7dcbb4c761dac9b0e687fb4f1ab526","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-27T14:06:20Z","title_canon_sha256":"a4e89aaccdc9807bac9041babe44c769c910a43d89bc65ce8441dc8f2a4660af"},"schema_version":"1.0","source":{"id":"1702.08290","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08290","created_at":"2026-05-18T00:16:33Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08290v2","created_at":"2026-05-18T00:16:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08290","created_at":"2026-05-18T00:16:33Z"},{"alias_kind":"pith_short_12","alias_value":"SU2BFVBHLITR","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SU2BFVBHLITRYVAS","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SU2BFVBH","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:e6c53858ff302bedfed37266df26f4971a9a5ac1a1258725e41326217204baa5","target":"graph","created_at":"2026-05-18T00:16:33Z","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":"Stochastic network optimization problems entail finding resource allocation policies that are optimum on an average but must be designed in an online fashion. Such problems are ubiquitous in communication networks, where resources such as energy and bandwidth are divided among nodes to satisfy certain long-term objectives. This paper proposes an asynchronous incremental dual decent resource allocation algorithm that utilizes delayed stochastic {gradients} for carrying out its updates. The proposed algorithm is well-suited to heterogeneous networks as it allows the computationally-challenged or","authors_text":"Amrit S. Bedi, Ketan Rajawat","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-27T14:06:20Z","title":"Asynchronous Incremental Stochastic Dual Descent Algorithm for Network Resource Allocation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08290","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:e22c7742fc90952ec4d14533102f8d420bcdcb1b3b14077b28ae6776c3105dab","target":"record","created_at":"2026-05-18T00:16:33Z","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":"11bf17de66a1800df4fd47636e755a6a1e7dcbb4c761dac9b0e687fb4f1ab526","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-27T14:06:20Z","title_canon_sha256":"a4e89aaccdc9807bac9041babe44c769c910a43d89bc65ce8441dc8f2a4660af"},"schema_version":"1.0","source":{"id":"1702.08290","kind":"arxiv","version":2}},"canonical_sha256":"953412d4275a271c5412087d92a77dae2fd0995883db764ac35ef06584e980d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"953412d4275a271c5412087d92a77dae2fd0995883db764ac35ef06584e980d5","first_computed_at":"2026-05-18T00:16:33.984023Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:33.984023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gFUUx8tBKz2y/ayZFTbneBOcBo1oGbj1bxbFNq6iJ+duVBPycKT+aTueyhymf2zjYu8N5VODXrqvym5BRnkaBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:33.984630Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.08290","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e22c7742fc90952ec4d14533102f8d420bcdcb1b3b14077b28ae6776c3105dab","sha256:e6c53858ff302bedfed37266df26f4971a9a5ac1a1258725e41326217204baa5"],"state_sha256":"cfe588c56057f09cc1b45b665494cf5aa11023036a004c0cff80707793f1b984"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WrL+RlJ5erDL+NjHvNSZ3hF3h8Lhi0eCqIEVH5/QFqEjmIKw+ILbq4EyM6b6iMJdGFPYZzgp4E5XHQiSiJmgCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T16:51:28.742678Z","bundle_sha256":"3decb67282d92e853d6f03dd62cd20a3890b0f323b98be4075d1a1afd1ec3213"}}