{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:5S2T3COHEFAUE6M7HLQKAU3GNV","short_pith_number":"pith:5S2T3COH","canonical_record":{"source":{"id":"1510.02973","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-10T19:52:38Z","cross_cats_sorted":[],"title_canon_sha256":"099eaeed9cbcf1679fb9f0c6169bbf877a9ef8494868423c5842cdd0cc5c6dc3","abstract_canon_sha256":"b9c973c3061691472ca67ba4665b6111a3514aa6dde1babd80304602ffc1bbf6"},"schema_version":"1.0"},"canonical_sha256":"ecb53d89c7214142799f3ae0a053666d6f9d47256d6af33dfb9505fef4991ed6","source":{"kind":"arxiv","id":"1510.02973","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.02973","created_at":"2026-05-18T00:54:48Z"},{"alias_kind":"arxiv_version","alias_value":"1510.02973v3","created_at":"2026-05-18T00:54:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02973","created_at":"2026-05-18T00:54:48Z"},{"alias_kind":"pith_short_12","alias_value":"5S2T3COHEFAU","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"5S2T3COHEFAUE6M7","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"5S2T3COH","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:5S2T3COHEFAUE6M7HLQKAU3GNV","target":"record","payload":{"canonical_record":{"source":{"id":"1510.02973","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-10T19:52:38Z","cross_cats_sorted":[],"title_canon_sha256":"099eaeed9cbcf1679fb9f0c6169bbf877a9ef8494868423c5842cdd0cc5c6dc3","abstract_canon_sha256":"b9c973c3061691472ca67ba4665b6111a3514aa6dde1babd80304602ffc1bbf6"},"schema_version":"1.0"},"canonical_sha256":"ecb53d89c7214142799f3ae0a053666d6f9d47256d6af33dfb9505fef4991ed6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:48.104116Z","signature_b64":"sPkw+tqBnVo8HDYSeXZbFtZjQrEqBF3Mmbk6SakY3USz4TzaIJlntVhZ8h2t8MVd/fyurpCmyEbCoVjr09evDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecb53d89c7214142799f3ae0a053666d6f9d47256d6af33dfb9505fef4991ed6","last_reissued_at":"2026-05-18T00:54:48.103465Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:48.103465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.02973","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:54:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nicWv2d8k7EwWdZJciidP8eB7ldEiyMAML5lpXDsFrMUBMtOiEFjvMacHyIthSkKbUZkXiLdTZWjPPSyZkogAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T10:33:59.122259Z"},"content_sha256":"c4c5ed6cfcad244731e08354bf125b6c813de207663108be964cdd637e67c666","schema_version":"1.0","event_id":"sha256:c4c5ed6cfcad244731e08354bf125b6c813de207663108be964cdd637e67c666"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:5S2T3COHEFAUE6M7HLQKAU3GNV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Probabilistic Sample Path Convergence Time Analysis of Drift-Plus-Penalty Algorithm for Stochastic Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hao Yu, Michael J. Neely, Xiaohan Wei","submitted_at":"2015-10-10T19:52:38Z","abstract_excerpt":"This paper considers the problem of minimizing the time average of a controlled stochastic process subject to multiple time average constraints on other related processes. The probability distribution of the random events in the system is unknown to the controller. A typical application is time average power minimization subject to network throughput constraints for different users in a network with time varying channel conditions. We show that with probability at least $1-2\\delta$, the classical drift-plus-penalty algorithm provides a sample path $\\mathcal{O}(\\varepsilon)$ approximation to op"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02973","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:54:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DySMVm3RVa9uMq6j674nB0geG19QvmDzAh/yhhleQSMpCde6klv03I7PdNvV+CKmOP9cbT2hsTEFvNMba8UzAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T10:33:59.122634Z"},"content_sha256":"4c7efbed64b7adadc9876da448249eaf0c219923105e1a5bf517fdb1e37a2491","schema_version":"1.0","event_id":"sha256:4c7efbed64b7adadc9876da448249eaf0c219923105e1a5bf517fdb1e37a2491"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5S2T3COHEFAUE6M7HLQKAU3GNV/bundle.json","state_url":"https://pith.science/pith/5S2T3COHEFAUE6M7HLQKAU3GNV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5S2T3COHEFAUE6M7HLQKAU3GNV/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-04T10:33:59Z","links":{"resolver":"https://pith.science/pith/5S2T3COHEFAUE6M7HLQKAU3GNV","bundle":"https://pith.science/pith/5S2T3COHEFAUE6M7HLQKAU3GNV/bundle.json","state":"https://pith.science/pith/5S2T3COHEFAUE6M7HLQKAU3GNV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5S2T3COHEFAUE6M7HLQKAU3GNV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5S2T3COHEFAUE6M7HLQKAU3GNV","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":"b9c973c3061691472ca67ba4665b6111a3514aa6dde1babd80304602ffc1bbf6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-10T19:52:38Z","title_canon_sha256":"099eaeed9cbcf1679fb9f0c6169bbf877a9ef8494868423c5842cdd0cc5c6dc3"},"schema_version":"1.0","source":{"id":"1510.02973","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.02973","created_at":"2026-05-18T00:54:48Z"},{"alias_kind":"arxiv_version","alias_value":"1510.02973v3","created_at":"2026-05-18T00:54:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02973","created_at":"2026-05-18T00:54:48Z"},{"alias_kind":"pith_short_12","alias_value":"5S2T3COHEFAU","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"5S2T3COHEFAUE6M7","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"5S2T3COH","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:4c7efbed64b7adadc9876da448249eaf0c219923105e1a5bf517fdb1e37a2491","target":"graph","created_at":"2026-05-18T00:54:48Z","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":"This paper considers the problem of minimizing the time average of a controlled stochastic process subject to multiple time average constraints on other related processes. The probability distribution of the random events in the system is unknown to the controller. A typical application is time average power minimization subject to network throughput constraints for different users in a network with time varying channel conditions. We show that with probability at least $1-2\\delta$, the classical drift-plus-penalty algorithm provides a sample path $\\mathcal{O}(\\varepsilon)$ approximation to op","authors_text":"Hao Yu, Michael J. Neely, Xiaohan Wei","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-10T19:52:38Z","title":"A Probabilistic Sample Path Convergence Time Analysis of Drift-Plus-Penalty Algorithm for Stochastic Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02973","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:c4c5ed6cfcad244731e08354bf125b6c813de207663108be964cdd637e67c666","target":"record","created_at":"2026-05-18T00:54:48Z","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":"b9c973c3061691472ca67ba4665b6111a3514aa6dde1babd80304602ffc1bbf6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-10T19:52:38Z","title_canon_sha256":"099eaeed9cbcf1679fb9f0c6169bbf877a9ef8494868423c5842cdd0cc5c6dc3"},"schema_version":"1.0","source":{"id":"1510.02973","kind":"arxiv","version":3}},"canonical_sha256":"ecb53d89c7214142799f3ae0a053666d6f9d47256d6af33dfb9505fef4991ed6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ecb53d89c7214142799f3ae0a053666d6f9d47256d6af33dfb9505fef4991ed6","first_computed_at":"2026-05-18T00:54:48.103465Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:48.103465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sPkw+tqBnVo8HDYSeXZbFtZjQrEqBF3Mmbk6SakY3USz4TzaIJlntVhZ8h2t8MVd/fyurpCmyEbCoVjr09evDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:48.104116Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.02973","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c4c5ed6cfcad244731e08354bf125b6c813de207663108be964cdd637e67c666","sha256:4c7efbed64b7adadc9876da448249eaf0c219923105e1a5bf517fdb1e37a2491"],"state_sha256":"95f8613524107bbd346131624494c0d099751d051eede5387dab044b90739be1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WrJDt3BTvzoamdAL7xQGEZ1/Bw1XQGgvtsKrpUZMH+tHoG4c3sd9TbN1Pz+q/brxlulpxcQ3aalWzfFxWK6VBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T10:33:59.124678Z","bundle_sha256":"6330b16ad4122736f7b834467fd6744ba55887eb9f86620af409f30235556159"}}