{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TBI3M3X7D3NPGI4VQCTSHBZAD3","short_pith_number":"pith:TBI3M3X7","schema_version":"1.0","canonical_sha256":"9851b66eff1edaf3239580a72387201ec21c2230ce6b383b00d6901bf175e48a","source":{"kind":"arxiv","id":"1412.0791","version":1},"attestation_state":"computed","paper":{"title":"A Simple Convergence Time Analysis of Drift-Plus-Penalty for Stochastic Optimization and Convex Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Michael J. Neely","submitted_at":"2014-12-02T06:29:13Z","abstract_excerpt":"This paper considers the problem of minimizing the time average of a stochastic process subject to time average constraints on other processes. A canonical example is minimizing average power in a data network subject to multi-user throughput constraints. Another example is a (static) convex program. Under a Slater condition, the drift-plus-penalty algorithm is known to provide an $O(\\epsilon)$ approximation to optimality with a convergence time of $O(1/\\epsilon^2)$. This paper proves the same result with a simpler technique and in a more general context that does not require the Slater condit"},"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":"1412.0791","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-12-02T06:29:13Z","cross_cats_sorted":[],"title_canon_sha256":"5c3e6311d48916b5bd39576b10424db355151884272267258b15057541ccda2c","abstract_canon_sha256":"aa64a9759c30d6b3de7fa080b387641b711b74805ae070c899229fe1a64559f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:21.201904Z","signature_b64":"ewRGzRNVzxdElPBqZeDEp7aSFiRUHqiyF7bc4JuJaZ1pqNcU+h9S7CY/WfB8fRIz9xnjpv0onkIsYGdH7XIzCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9851b66eff1edaf3239580a72387201ec21c2230ce6b383b00d6901bf175e48a","last_reissued_at":"2026-05-18T02:32:21.201542Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:21.201542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Simple Convergence Time Analysis of Drift-Plus-Penalty for Stochastic Optimization and Convex Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Michael J. Neely","submitted_at":"2014-12-02T06:29:13Z","abstract_excerpt":"This paper considers the problem of minimizing the time average of a stochastic process subject to time average constraints on other processes. A canonical example is minimizing average power in a data network subject to multi-user throughput constraints. Another example is a (static) convex program. Under a Slater condition, the drift-plus-penalty algorithm is known to provide an $O(\\epsilon)$ approximation to optimality with a convergence time of $O(1/\\epsilon^2)$. This paper proves the same result with a simpler technique and in a more general context that does not require the Slater condit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0791","kind":"arxiv","version":1},"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":"1412.0791","created_at":"2026-05-18T02:32:21.201598+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.0791v1","created_at":"2026-05-18T02:32:21.201598+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0791","created_at":"2026-05-18T02:32:21.201598+00:00"},{"alias_kind":"pith_short_12","alias_value":"TBI3M3X7D3NP","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"TBI3M3X7D3NPGI4V","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"TBI3M3X7","created_at":"2026-05-18T12:28:49.207871+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/TBI3M3X7D3NPGI4VQCTSHBZAD3","json":"https://pith.science/pith/TBI3M3X7D3NPGI4VQCTSHBZAD3.json","graph_json":"https://pith.science/api/pith-number/TBI3M3X7D3NPGI4VQCTSHBZAD3/graph.json","events_json":"https://pith.science/api/pith-number/TBI3M3X7D3NPGI4VQCTSHBZAD3/events.json","paper":"https://pith.science/paper/TBI3M3X7"},"agent_actions":{"view_html":"https://pith.science/pith/TBI3M3X7D3NPGI4VQCTSHBZAD3","download_json":"https://pith.science/pith/TBI3M3X7D3NPGI4VQCTSHBZAD3.json","view_paper":"https://pith.science/paper/TBI3M3X7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.0791&json=true","fetch_graph":"https://pith.science/api/pith-number/TBI3M3X7D3NPGI4VQCTSHBZAD3/graph.json","fetch_events":"https://pith.science/api/pith-number/TBI3M3X7D3NPGI4VQCTSHBZAD3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TBI3M3X7D3NPGI4VQCTSHBZAD3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TBI3M3X7D3NPGI4VQCTSHBZAD3/action/storage_attestation","attest_author":"https://pith.science/pith/TBI3M3X7D3NPGI4VQCTSHBZAD3/action/author_attestation","sign_citation":"https://pith.science/pith/TBI3M3X7D3NPGI4VQCTSHBZAD3/action/citation_signature","submit_replication":"https://pith.science/pith/TBI3M3X7D3NPGI4VQCTSHBZAD3/action/replication_record"}},"created_at":"2026-05-18T02:32:21.201598+00:00","updated_at":"2026-05-18T02:32:21.201598+00:00"}