{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YFF3YMYUF6Y752KC72GRXGTTY6","short_pith_number":"pith:YFF3YMYU","canonical_record":{"source":{"id":"1608.00195","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-31T07:07:00Z","cross_cats_sorted":[],"title_canon_sha256":"39bf3150ec89b31696ef0afe5d65f3ae3a4250ae70b25286c6aeaf5e7dad6b63","abstract_canon_sha256":"8d44a32c84889bd5f2a3ee8ef7cf36d951522005b69a0ca4e4c500fe4ad99089"},"schema_version":"1.0"},"canonical_sha256":"c14bbc33142fb1fee942fe8d1b9a73c7af6ab28e0c565afd4a3ea79572d2020a","source":{"kind":"arxiv","id":"1608.00195","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.00195","created_at":"2026-05-18T00:15:31Z"},{"alias_kind":"arxiv_version","alias_value":"1608.00195v5","created_at":"2026-05-18T00:15:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00195","created_at":"2026-05-18T00:15:31Z"},{"alias_kind":"pith_short_12","alias_value":"YFF3YMYUF6Y7","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YFF3YMYUF6Y752KC","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YFF3YMYU","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YFF3YMYUF6Y752KC72GRXGTTY6","target":"record","payload":{"canonical_record":{"source":{"id":"1608.00195","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-31T07:07:00Z","cross_cats_sorted":[],"title_canon_sha256":"39bf3150ec89b31696ef0afe5d65f3ae3a4250ae70b25286c6aeaf5e7dad6b63","abstract_canon_sha256":"8d44a32c84889bd5f2a3ee8ef7cf36d951522005b69a0ca4e4c500fe4ad99089"},"schema_version":"1.0"},"canonical_sha256":"c14bbc33142fb1fee942fe8d1b9a73c7af6ab28e0c565afd4a3ea79572d2020a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:31.067093Z","signature_b64":"uTcUA/+OA8zROD2aH4/G/I+AT/1PkWixHXUAoBDfmsHNZ0kAG9xzZr4UuseXM+jehQItysen6MUSCoFtmAnjAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c14bbc33142fb1fee942fe8d1b9a73c7af6ab28e0c565afd4a3ea79572d2020a","last_reissued_at":"2026-05-18T00:15:31.066397Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:31.066397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.00195","source_version":5,"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:15:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3onR4qsH7+P9bsvrcdo8hPLia5MChL1bNveTMPLdgsLseS2OdF3Z1H4HtzVbjpN2v2T/p4BMbiKjgNO6nLpYCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:26:20.416124Z"},"content_sha256":"56edd4c11ef76cc5175926846b9ca6c59392f3e0e534ee54ebf926110f9a35ec","schema_version":"1.0","event_id":"sha256:56edd4c11ef76cc5175926846b9ca6c59392f3e0e534ee54ebf926110f9a35ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YFF3YMYUF6Y752KC72GRXGTTY6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asynchronous Optimization over Weakly Coupled Renewal Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Michael J. Neely, Xiaohan Wei","submitted_at":"2016-07-31T07:07:00Z","abstract_excerpt":"This paper considers optimization over multiple renewal systems coupled by time average constraints. These systems act asynchronously over variable length frames. For each system, at the beginning of each renewal frame, it chooses an action which affects the duration of its own frame, the penalty, and the resource expenditure throughout the frame. The goal is to minimize the overall time average penalty subject to several overall time average resource constraints which couple these systems. This problem has applications to task processing networks, coupled Markov decision processes(MDPs) and s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00195","kind":"arxiv","version":5},"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:15:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zVdG9bu5DmBa+uBV3MrhS7AcP4nU/KzEBs6hvtyZygCMMK1+lotW5zOX0Q1962uInobzWYPrfPKHmE0h6PKFCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:26:20.416738Z"},"content_sha256":"e686dadeca1f90ee5b25757f9152a552485fe9a1320800cddca1c51a3c03ab8c","schema_version":"1.0","event_id":"sha256:e686dadeca1f90ee5b25757f9152a552485fe9a1320800cddca1c51a3c03ab8c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YFF3YMYUF6Y752KC72GRXGTTY6/bundle.json","state_url":"https://pith.science/pith/YFF3YMYUF6Y752KC72GRXGTTY6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YFF3YMYUF6Y752KC72GRXGTTY6/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-30T02:26:20Z","links":{"resolver":"https://pith.science/pith/YFF3YMYUF6Y752KC72GRXGTTY6","bundle":"https://pith.science/pith/YFF3YMYUF6Y752KC72GRXGTTY6/bundle.json","state":"https://pith.science/pith/YFF3YMYUF6Y752KC72GRXGTTY6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YFF3YMYUF6Y752KC72GRXGTTY6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YFF3YMYUF6Y752KC72GRXGTTY6","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":"8d44a32c84889bd5f2a3ee8ef7cf36d951522005b69a0ca4e4c500fe4ad99089","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-31T07:07:00Z","title_canon_sha256":"39bf3150ec89b31696ef0afe5d65f3ae3a4250ae70b25286c6aeaf5e7dad6b63"},"schema_version":"1.0","source":{"id":"1608.00195","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.00195","created_at":"2026-05-18T00:15:31Z"},{"alias_kind":"arxiv_version","alias_value":"1608.00195v5","created_at":"2026-05-18T00:15:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00195","created_at":"2026-05-18T00:15:31Z"},{"alias_kind":"pith_short_12","alias_value":"YFF3YMYUF6Y7","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YFF3YMYUF6Y752KC","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YFF3YMYU","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:e686dadeca1f90ee5b25757f9152a552485fe9a1320800cddca1c51a3c03ab8c","target":"graph","created_at":"2026-05-18T00:15:31Z","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 optimization over multiple renewal systems coupled by time average constraints. These systems act asynchronously over variable length frames. For each system, at the beginning of each renewal frame, it chooses an action which affects the duration of its own frame, the penalty, and the resource expenditure throughout the frame. The goal is to minimize the overall time average penalty subject to several overall time average resource constraints which couple these systems. This problem has applications to task processing networks, coupled Markov decision processes(MDPs) and s","authors_text":"Michael J. Neely, Xiaohan Wei","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-31T07:07:00Z","title":"Asynchronous Optimization over Weakly Coupled Renewal Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00195","kind":"arxiv","version":5},"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:56edd4c11ef76cc5175926846b9ca6c59392f3e0e534ee54ebf926110f9a35ec","target":"record","created_at":"2026-05-18T00:15:31Z","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":"8d44a32c84889bd5f2a3ee8ef7cf36d951522005b69a0ca4e4c500fe4ad99089","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-31T07:07:00Z","title_canon_sha256":"39bf3150ec89b31696ef0afe5d65f3ae3a4250ae70b25286c6aeaf5e7dad6b63"},"schema_version":"1.0","source":{"id":"1608.00195","kind":"arxiv","version":5}},"canonical_sha256":"c14bbc33142fb1fee942fe8d1b9a73c7af6ab28e0c565afd4a3ea79572d2020a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c14bbc33142fb1fee942fe8d1b9a73c7af6ab28e0c565afd4a3ea79572d2020a","first_computed_at":"2026-05-18T00:15:31.066397Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:31.066397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uTcUA/+OA8zROD2aH4/G/I+AT/1PkWixHXUAoBDfmsHNZ0kAG9xzZr4UuseXM+jehQItysen6MUSCoFtmAnjAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:31.067093Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.00195","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56edd4c11ef76cc5175926846b9ca6c59392f3e0e534ee54ebf926110f9a35ec","sha256:e686dadeca1f90ee5b25757f9152a552485fe9a1320800cddca1c51a3c03ab8c"],"state_sha256":"e534693cfc5932cb8469af33fa34eeef775953d9338606e1145d1c7a330128a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LT4oCKc4rd5dTYelZArBZbJqIuUWKK3nG01DkfB+rqOW/a3P/9EQLAsIb+lkGkkdmwjkroxz+BEAYR5aRc4ADA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T02:26:20.418930Z","bundle_sha256":"4ab6abc125780434a4981a2d2581908bff08b011f64fdfcc434c1728565fd2ee"}}