{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YIANK3KGT6A6LTC64S7SL4NAFH","short_pith_number":"pith:YIANK3KG","schema_version":"1.0","canonical_sha256":"c200d56d469f81e5cc5ee4bf25f1a029dcf94a2407ef0458cc5e66da23a4d399","source":{"kind":"arxiv","id":"1702.08054","version":3},"attestation_state":"computed","paper":{"title":"Network Resource Allocation via Stochastic Subgradient Descent: Convergence Rate","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Amrit Singh Bedi, Ketan Rajawat","submitted_at":"2017-02-26T17:12:23Z","abstract_excerpt":"This paper considers a general stochastic resource allocation problem that arises widely in wireless networks, cognitive radio, networks, smart-grid communications, and cross-layer design. The problem formulation involves expectations with respect to a collection of random variables with unknown distributions, representing exogenous quantities such as channel gain, user density, or spectrum occupancy. We consider the constant step-size stochastic dual subgradient descent (SDSD) method that has been widely used for online resource allocation in networks. The problem is solved in dual domain whi"},"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":"1702.08054","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-26T17:12:23Z","cross_cats_sorted":[],"title_canon_sha256":"66ca077f6522a397eb7f19ec28812a36f532d857e70a90da7305fcdfb18d372e","abstract_canon_sha256":"7e8a526345f59cefb04047f79477c34448435ccb12b8c6f5f53474da89918355"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:25.707939Z","signature_b64":"rQLjy2D2AaPTrQL4QXETxDI1WAyLY8PWwPFSQMUaAgMY58omwa+tJNn/soCO87ci3h875qyb0XYVxaTEgCfqDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c200d56d469f81e5cc5ee4bf25f1a029dcf94a2407ef0458cc5e66da23a4d399","last_reissued_at":"2026-05-18T00:28:25.707298Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:25.707298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Network Resource Allocation via Stochastic Subgradient Descent: Convergence Rate","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Amrit Singh Bedi, Ketan Rajawat","submitted_at":"2017-02-26T17:12:23Z","abstract_excerpt":"This paper considers a general stochastic resource allocation problem that arises widely in wireless networks, cognitive radio, networks, smart-grid communications, and cross-layer design. The problem formulation involves expectations with respect to a collection of random variables with unknown distributions, representing exogenous quantities such as channel gain, user density, or spectrum occupancy. We consider the constant step-size stochastic dual subgradient descent (SDSD) method that has been widely used for online resource allocation in networks. The problem is solved in dual domain whi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08054","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1702.08054","created_at":"2026-05-18T00:28:25.707465+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.08054v3","created_at":"2026-05-18T00:28:25.707465+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08054","created_at":"2026-05-18T00:28:25.707465+00:00"},{"alias_kind":"pith_short_12","alias_value":"YIANK3KGT6A6","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YIANK3KGT6A6LTC6","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YIANK3KG","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/YIANK3KGT6A6LTC64S7SL4NAFH","json":"https://pith.science/pith/YIANK3KGT6A6LTC64S7SL4NAFH.json","graph_json":"https://pith.science/api/pith-number/YIANK3KGT6A6LTC64S7SL4NAFH/graph.json","events_json":"https://pith.science/api/pith-number/YIANK3KGT6A6LTC64S7SL4NAFH/events.json","paper":"https://pith.science/paper/YIANK3KG"},"agent_actions":{"view_html":"https://pith.science/pith/YIANK3KGT6A6LTC64S7SL4NAFH","download_json":"https://pith.science/pith/YIANK3KGT6A6LTC64S7SL4NAFH.json","view_paper":"https://pith.science/paper/YIANK3KG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.08054&json=true","fetch_graph":"https://pith.science/api/pith-number/YIANK3KGT6A6LTC64S7SL4NAFH/graph.json","fetch_events":"https://pith.science/api/pith-number/YIANK3KGT6A6LTC64S7SL4NAFH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YIANK3KGT6A6LTC64S7SL4NAFH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YIANK3KGT6A6LTC64S7SL4NAFH/action/storage_attestation","attest_author":"https://pith.science/pith/YIANK3KGT6A6LTC64S7SL4NAFH/action/author_attestation","sign_citation":"https://pith.science/pith/YIANK3KGT6A6LTC64S7SL4NAFH/action/citation_signature","submit_replication":"https://pith.science/pith/YIANK3KGT6A6LTC64S7SL4NAFH/action/replication_record"}},"created_at":"2026-05-18T00:28:25.707465+00:00","updated_at":"2026-05-18T00:28:25.707465+00:00"}