{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:55XHHFYWMBKG5S5UBWN5YIC52R","short_pith_number":"pith:55XHHFYW","canonical_record":{"source":{"id":"1011.5942","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-11-27T01:09:17Z","cross_cats_sorted":[],"title_canon_sha256":"6e2e0047527c27fc569e1573b2f865b7a95ea351399eaa8869d6d88914d9244f","abstract_canon_sha256":"a00845a06ade2f71fc712d27a2f880500593bccf598014394530d96c15533c89"},"schema_version":"1.0"},"canonical_sha256":"ef6e73971660546ecbb40d9bdc205dd45f58a643ff753db9280f14ff505b67d2","source":{"kind":"arxiv","id":"1011.5942","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.5942","created_at":"2026-05-18T04:34:37Z"},{"alias_kind":"arxiv_version","alias_value":"1011.5942v1","created_at":"2026-05-18T04:34:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5942","created_at":"2026-05-18T04:34:37Z"},{"alias_kind":"pith_short_12","alias_value":"55XHHFYWMBKG","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"55XHHFYWMBKG5S5U","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"55XHHFYW","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:55XHHFYWMBKG5S5UBWN5YIC52R","target":"record","payload":{"canonical_record":{"source":{"id":"1011.5942","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-11-27T01:09:17Z","cross_cats_sorted":[],"title_canon_sha256":"6e2e0047527c27fc569e1573b2f865b7a95ea351399eaa8869d6d88914d9244f","abstract_canon_sha256":"a00845a06ade2f71fc712d27a2f880500593bccf598014394530d96c15533c89"},"schema_version":"1.0"},"canonical_sha256":"ef6e73971660546ecbb40d9bdc205dd45f58a643ff753db9280f14ff505b67d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:37.850417Z","signature_b64":"s7abs0CGkiqSMTCXVxvBwUVnuEiTxmOSfuO2FeH7joRPHMIFA+dvQxH2//eYC7DbrJGdSArUyX+ASKt455hZBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef6e73971660546ecbb40d9bdc205dd45f58a643ff753db9280f14ff505b67d2","last_reissued_at":"2026-05-18T04:34:37.849654Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:37.849654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.5942","source_version":1,"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-18T04:34:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vWCTq6R0F7fD4X3VQVT5EHNnRSRyB0i6IBWt4vazmndPQOJdZ3N/Ro/4dALD2mR00OIMrisvvOCWbACejWhXCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:23:14.644609Z"},"content_sha256":"e57a464c8c4f4653527166175f02652b57f3d4b0e7d4e291d05f23edf58fa395","schema_version":"1.0","event_id":"sha256:e57a464c8c4f4653527166175f02652b57f3d4b0e7d4e291d05f23edf58fa395"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:55XHHFYWMBKG5S5UBWN5YIC52R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Optimization and Learning for Renewal Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Michael J. Neely","submitted_at":"2010-11-27T01:09:17Z","abstract_excerpt":"We consider the problem of optimizing time averages in systems with independent and identically distributed behavior over renewal frames. This includes scheduling and task processing to maximize utility in stochastic networks with variable length scheduling modes. Every frame, a new policy is implemented that affects the frame size and that creates a vector of attributes. An algorithm is developed for choosing policies on each frame in order to maximize a concave function of the time average attribute vector, subject to additional time average constraints. The algorithm is based on Lyapunov op"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5942","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"},"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-18T04:34:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7IjnbVrpvDWARZwt6qVTRkKeGJJNFR/GrfNmX1pPumLlWRSUUD+tchJycyqzBgrv8KuDKRrtrorGBSIg3V0RAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:23:14.645242Z"},"content_sha256":"bdd09634dfe765ad0cdb369fa119a8d088f2215acaf8678f1143640ec76c6229","schema_version":"1.0","event_id":"sha256:bdd09634dfe765ad0cdb369fa119a8d088f2215acaf8678f1143640ec76c6229"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/55XHHFYWMBKG5S5UBWN5YIC52R/bundle.json","state_url":"https://pith.science/pith/55XHHFYWMBKG5S5UBWN5YIC52R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/55XHHFYWMBKG5S5UBWN5YIC52R/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:23:14Z","links":{"resolver":"https://pith.science/pith/55XHHFYWMBKG5S5UBWN5YIC52R","bundle":"https://pith.science/pith/55XHHFYWMBKG5S5UBWN5YIC52R/bundle.json","state":"https://pith.science/pith/55XHHFYWMBKG5S5UBWN5YIC52R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/55XHHFYWMBKG5S5UBWN5YIC52R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:55XHHFYWMBKG5S5UBWN5YIC52R","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":"a00845a06ade2f71fc712d27a2f880500593bccf598014394530d96c15533c89","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-11-27T01:09:17Z","title_canon_sha256":"6e2e0047527c27fc569e1573b2f865b7a95ea351399eaa8869d6d88914d9244f"},"schema_version":"1.0","source":{"id":"1011.5942","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.5942","created_at":"2026-05-18T04:34:37Z"},{"alias_kind":"arxiv_version","alias_value":"1011.5942v1","created_at":"2026-05-18T04:34:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5942","created_at":"2026-05-18T04:34:37Z"},{"alias_kind":"pith_short_12","alias_value":"55XHHFYWMBKG","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"55XHHFYWMBKG5S5U","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"55XHHFYW","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:bdd09634dfe765ad0cdb369fa119a8d088f2215acaf8678f1143640ec76c6229","target":"graph","created_at":"2026-05-18T04:34:37Z","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":"We consider the problem of optimizing time averages in systems with independent and identically distributed behavior over renewal frames. This includes scheduling and task processing to maximize utility in stochastic networks with variable length scheduling modes. Every frame, a new policy is implemented that affects the frame size and that creates a vector of attributes. An algorithm is developed for choosing policies on each frame in order to maximize a concave function of the time average attribute vector, subject to additional time average constraints. The algorithm is based on Lyapunov op","authors_text":"Michael J. Neely","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-11-27T01:09:17Z","title":"Dynamic Optimization and Learning for Renewal Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5942","kind":"arxiv","version":1},"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:e57a464c8c4f4653527166175f02652b57f3d4b0e7d4e291d05f23edf58fa395","target":"record","created_at":"2026-05-18T04:34:37Z","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":"a00845a06ade2f71fc712d27a2f880500593bccf598014394530d96c15533c89","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-11-27T01:09:17Z","title_canon_sha256":"6e2e0047527c27fc569e1573b2f865b7a95ea351399eaa8869d6d88914d9244f"},"schema_version":"1.0","source":{"id":"1011.5942","kind":"arxiv","version":1}},"canonical_sha256":"ef6e73971660546ecbb40d9bdc205dd45f58a643ff753db9280f14ff505b67d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef6e73971660546ecbb40d9bdc205dd45f58a643ff753db9280f14ff505b67d2","first_computed_at":"2026-05-18T04:34:37.849654Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:34:37.849654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s7abs0CGkiqSMTCXVxvBwUVnuEiTxmOSfuO2FeH7joRPHMIFA+dvQxH2//eYC7DbrJGdSArUyX+ASKt455hZBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:34:37.850417Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.5942","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e57a464c8c4f4653527166175f02652b57f3d4b0e7d4e291d05f23edf58fa395","sha256:bdd09634dfe765ad0cdb369fa119a8d088f2215acaf8678f1143640ec76c6229"],"state_sha256":"de3ae06cda97cef8ec1cc02c213cf57ca72583d9dd0f7181b811d32134bdaf70"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a1bep1aKpJCGo0E7Jccfb7g8nhj3+3fScVtWwr0QDEtIA5fuey6v1aPioAS2orvzWt3ijK1c9mr1XdvuF3xTAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T02:23:14.648553Z","bundle_sha256":"e91860d088d64059c6d5c2b9a4c1a631816ef2efaf4200358c57c9c8eaa31525"}}