{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FLHX6SSSLTEUR3HTTGION2VY2B","short_pith_number":"pith:FLHX6SSS","canonical_record":{"source":{"id":"1610.02617","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-09T02:51:39Z","cross_cats_sorted":[],"title_canon_sha256":"0bc38d7e88d643747a82bdb43fc39dd8c60089231f2123013da6be936b7fa8f3","abstract_canon_sha256":"51ff45ae70e643316044c0eda688a890a12a4175e2df80efb349992a97cd01e5"},"schema_version":"1.0"},"canonical_sha256":"2acf7f4a525cc948ecf39990e6eab8d070f505aaeb08d3f2cf80bb7a29db45cf","source":{"kind":"arxiv","id":"1610.02617","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.02617","created_at":"2026-05-18T01:02:51Z"},{"alias_kind":"arxiv_version","alias_value":"1610.02617v1","created_at":"2026-05-18T01:02:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02617","created_at":"2026-05-18T01:02:51Z"},{"alias_kind":"pith_short_12","alias_value":"FLHX6SSSLTEU","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FLHX6SSSLTEUR3HT","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FLHX6SSS","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FLHX6SSSLTEUR3HTTGION2VY2B","target":"record","payload":{"canonical_record":{"source":{"id":"1610.02617","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-09T02:51:39Z","cross_cats_sorted":[],"title_canon_sha256":"0bc38d7e88d643747a82bdb43fc39dd8c60089231f2123013da6be936b7fa8f3","abstract_canon_sha256":"51ff45ae70e643316044c0eda688a890a12a4175e2df80efb349992a97cd01e5"},"schema_version":"1.0"},"canonical_sha256":"2acf7f4a525cc948ecf39990e6eab8d070f505aaeb08d3f2cf80bb7a29db45cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:51.129498Z","signature_b64":"rfu8HsGAPLVC9qZc3aP2jHaH+mAkHIggZGSZeas8tYvBWNDWq442VoRLDoUfe8fyNuCph7V1U5FOx16Pfk1aCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2acf7f4a525cc948ecf39990e6eab8d070f505aaeb08d3f2cf80bb7a29db45cf","last_reissued_at":"2026-05-18T01:02:51.128952Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:51.128952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.02617","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-18T01:02:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zyCoqeoHEP9e6naK+HRq93Acz7BQEF833kBaVchiLA777p0IBbHme7BZKt++PciZd+IzFk0R8QffOpTI2TEmAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:23:18.586490Z"},"content_sha256":"782bfd9d6eb19fa764e9e434f1c27e4a4de7ff118103dc858098e5578c6f801b","schema_version":"1.0","event_id":"sha256:782bfd9d6eb19fa764e9e434f1c27e4a4de7ff118103dc858098e5578c6f801b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FLHX6SSSLTEUR3HTTGION2VY2B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Time-Average Optimization with Non-Convex Decision Set and Its Convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Longbo Huang, Michael J. Neely, Sucha Supittayapornpong","submitted_at":"2016-10-09T02:51:39Z","abstract_excerpt":"This paper considers time-average optimization, where a decision vector is chosen every time step within a (possibly non-convex) set, and the goal is to minimize a convex function of the time averages subject to convex constraints on these averages. Such problems have applications in networking, multi-agent systems, and operations research, where decisions are constrained to a discrete set and the decision average can represent average bit rates or average agent actions. This time-average optimization extends traditional convex formulations to allow a non-convex decision set. This class of pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02617","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-18T01:02:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MEcX9W9kEHkWAHfWnD0xEzuwHbmnasaBjyzfAJ52iUc2nWmcW2d5sk0Iq8nREj1XPwHBLQj0mIFuCgI2+zQ5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:23:18.586829Z"},"content_sha256":"82d8467d92ae83e0c45710063fc01c5ad3428d04a57f93d7aa285a055a20f872","schema_version":"1.0","event_id":"sha256:82d8467d92ae83e0c45710063fc01c5ad3428d04a57f93d7aa285a055a20f872"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FLHX6SSSLTEUR3HTTGION2VY2B/bundle.json","state_url":"https://pith.science/pith/FLHX6SSSLTEUR3HTTGION2VY2B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FLHX6SSSLTEUR3HTTGION2VY2B/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-30T08:23:18Z","links":{"resolver":"https://pith.science/pith/FLHX6SSSLTEUR3HTTGION2VY2B","bundle":"https://pith.science/pith/FLHX6SSSLTEUR3HTTGION2VY2B/bundle.json","state":"https://pith.science/pith/FLHX6SSSLTEUR3HTTGION2VY2B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FLHX6SSSLTEUR3HTTGION2VY2B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FLHX6SSSLTEUR3HTTGION2VY2B","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":"51ff45ae70e643316044c0eda688a890a12a4175e2df80efb349992a97cd01e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-09T02:51:39Z","title_canon_sha256":"0bc38d7e88d643747a82bdb43fc39dd8c60089231f2123013da6be936b7fa8f3"},"schema_version":"1.0","source":{"id":"1610.02617","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.02617","created_at":"2026-05-18T01:02:51Z"},{"alias_kind":"arxiv_version","alias_value":"1610.02617v1","created_at":"2026-05-18T01:02:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02617","created_at":"2026-05-18T01:02:51Z"},{"alias_kind":"pith_short_12","alias_value":"FLHX6SSSLTEU","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FLHX6SSSLTEUR3HT","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FLHX6SSS","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:82d8467d92ae83e0c45710063fc01c5ad3428d04a57f93d7aa285a055a20f872","target":"graph","created_at":"2026-05-18T01:02:51Z","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 time-average optimization, where a decision vector is chosen every time step within a (possibly non-convex) set, and the goal is to minimize a convex function of the time averages subject to convex constraints on these averages. Such problems have applications in networking, multi-agent systems, and operations research, where decisions are constrained to a discrete set and the decision average can represent average bit rates or average agent actions. This time-average optimization extends traditional convex formulations to allow a non-convex decision set. This class of pro","authors_text":"Longbo Huang, Michael J. Neely, Sucha Supittayapornpong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-09T02:51:39Z","title":"Time-Average Optimization with Non-Convex Decision Set and Its Convergence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02617","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:782bfd9d6eb19fa764e9e434f1c27e4a4de7ff118103dc858098e5578c6f801b","target":"record","created_at":"2026-05-18T01:02:51Z","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":"51ff45ae70e643316044c0eda688a890a12a4175e2df80efb349992a97cd01e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-09T02:51:39Z","title_canon_sha256":"0bc38d7e88d643747a82bdb43fc39dd8c60089231f2123013da6be936b7fa8f3"},"schema_version":"1.0","source":{"id":"1610.02617","kind":"arxiv","version":1}},"canonical_sha256":"2acf7f4a525cc948ecf39990e6eab8d070f505aaeb08d3f2cf80bb7a29db45cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2acf7f4a525cc948ecf39990e6eab8d070f505aaeb08d3f2cf80bb7a29db45cf","first_computed_at":"2026-05-18T01:02:51.128952Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:51.128952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rfu8HsGAPLVC9qZc3aP2jHaH+mAkHIggZGSZeas8tYvBWNDWq442VoRLDoUfe8fyNuCph7V1U5FOx16Pfk1aCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:51.129498Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.02617","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:782bfd9d6eb19fa764e9e434f1c27e4a4de7ff118103dc858098e5578c6f801b","sha256:82d8467d92ae83e0c45710063fc01c5ad3428d04a57f93d7aa285a055a20f872"],"state_sha256":"03a51c4ebfd3ac3d11f90682bf2fc406c55c92ce334cfa2104c1078c3a6034f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KRMRZM5/DkeP0wCcqiv16QfQFlqcxmWHXdzEOAKBnya3/oqu0OwtEWR9mkp0gG/QdHeeVAHcL+97UsnUVgqiCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:23:18.588742Z","bundle_sha256":"fdf024d55443ca081a2c258f3eeb52caa212b3908a6e7ded185c09e2510c1005"}}