{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:N35BG4A76DCS4TZPMZP6EZYPTF","short_pith_number":"pith:N35BG4A7","canonical_record":{"source":{"id":"1410.7171","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-27T10:28:12Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"c7bd25c296b200a9910288accf8f8318ae5ae46bf6a79dc35311eea7dbb16dfc","abstract_canon_sha256":"dfdfada390dda8a211242b96f20a21de467a2669d1262373242692d462697172"},"schema_version":"1.0"},"canonical_sha256":"6efa13701ff0c52e4f2f665fe2670f994e2f2ea77d77faf35eb181911f77eb2b","source":{"kind":"arxiv","id":"1410.7171","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.7171","created_at":"2026-05-18T02:27:56Z"},{"alias_kind":"arxiv_version","alias_value":"1410.7171v2","created_at":"2026-05-18T02:27:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7171","created_at":"2026-05-18T02:27:56Z"},{"alias_kind":"pith_short_12","alias_value":"N35BG4A76DCS","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"N35BG4A76DCS4TZP","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"N35BG4A7","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:N35BG4A76DCS4TZPMZP6EZYPTF","target":"record","payload":{"canonical_record":{"source":{"id":"1410.7171","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-27T10:28:12Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"c7bd25c296b200a9910288accf8f8318ae5ae46bf6a79dc35311eea7dbb16dfc","abstract_canon_sha256":"dfdfada390dda8a211242b96f20a21de467a2669d1262373242692d462697172"},"schema_version":"1.0"},"canonical_sha256":"6efa13701ff0c52e4f2f665fe2670f994e2f2ea77d77faf35eb181911f77eb2b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:56.879152Z","signature_b64":"HyoW31rSIggT5hLQQyt6PKQLLxoD2GS67yenIoLk8tyygztJgL2TeS8hptP7YXTV70tv05TPA0V5Yaw1oLQrBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6efa13701ff0c52e4f2f665fe2670f994e2f2ea77d77faf35eb181911f77eb2b","last_reissued_at":"2026-05-18T02:27:56.878565Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:56.878565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.7171","source_version":2,"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-18T02:27:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CcXYdIH30l49MXLjIAmRKY5WlWfmEBT3+OBCcF0VVlTlawD+fnzj8+3/5eYl9REzxibWE8TLfOeabIGxLznmCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:30:36.631216Z"},"content_sha256":"02e690ce435814a8c2eedc1d14dfcc901b35701e9c347ab1a9b17197ce939ade","schema_version":"1.0","event_id":"sha256:02e690ce435814a8c2eedc1d14dfcc901b35701e9c347ab1a9b17197ce939ade"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:N35BG4A76DCS4TZPMZP6EZYPTF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exponentiated Subgradient Algorithm for Online Optimization under the Random Permutation Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"math.OC","authors_text":"Jon Swenson, Maryam Fazel, Reza Eghbali","submitted_at":"2014-10-27T10:28:12Z","abstract_excerpt":"Online optimization problems arise in many resource allocation tasks, where the future demands for each resource and the associated utility functions change over time and are not known apriori, yet resources need to be allocated at every point in time despite the future uncertainty. In this paper, we consider online optimization problems with general concave utilities. We modify and extend an online optimization algorithm proposed by Devanur et al. for linear programming to this general setting. The model we use for the arrival of the utilities and demands is known as the random permutation mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7171","kind":"arxiv","version":2},"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-18T02:27:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bwBd+TPYtDeVjpK2pwvb1fDcB4Wmv3jGxHSZ9wbcUyKt7r1dGvJeE4BYU0W3fU6bjQ84XK9L4h+pWhZlCN5JDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:30:36.631902Z"},"content_sha256":"f281c9ce5121c56ce322a020f3dd1b18c88041d3e12b9fd4b5632cc793472a30","schema_version":"1.0","event_id":"sha256:f281c9ce5121c56ce322a020f3dd1b18c88041d3e12b9fd4b5632cc793472a30"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N35BG4A76DCS4TZPMZP6EZYPTF/bundle.json","state_url":"https://pith.science/pith/N35BG4A76DCS4TZPMZP6EZYPTF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N35BG4A76DCS4TZPMZP6EZYPTF/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-31T16:30:36Z","links":{"resolver":"https://pith.science/pith/N35BG4A76DCS4TZPMZP6EZYPTF","bundle":"https://pith.science/pith/N35BG4A76DCS4TZPMZP6EZYPTF/bundle.json","state":"https://pith.science/pith/N35BG4A76DCS4TZPMZP6EZYPTF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N35BG4A76DCS4TZPMZP6EZYPTF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:N35BG4A76DCS4TZPMZP6EZYPTF","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":"dfdfada390dda8a211242b96f20a21de467a2669d1262373242692d462697172","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-27T10:28:12Z","title_canon_sha256":"c7bd25c296b200a9910288accf8f8318ae5ae46bf6a79dc35311eea7dbb16dfc"},"schema_version":"1.0","source":{"id":"1410.7171","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.7171","created_at":"2026-05-18T02:27:56Z"},{"alias_kind":"arxiv_version","alias_value":"1410.7171v2","created_at":"2026-05-18T02:27:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7171","created_at":"2026-05-18T02:27:56Z"},{"alias_kind":"pith_short_12","alias_value":"N35BG4A76DCS","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"N35BG4A76DCS4TZP","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"N35BG4A7","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:f281c9ce5121c56ce322a020f3dd1b18c88041d3e12b9fd4b5632cc793472a30","target":"graph","created_at":"2026-05-18T02:27:56Z","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":"Online optimization problems arise in many resource allocation tasks, where the future demands for each resource and the associated utility functions change over time and are not known apriori, yet resources need to be allocated at every point in time despite the future uncertainty. In this paper, we consider online optimization problems with general concave utilities. We modify and extend an online optimization algorithm proposed by Devanur et al. for linear programming to this general setting. The model we use for the arrival of the utilities and demands is known as the random permutation mo","authors_text":"Jon Swenson, Maryam Fazel, Reza Eghbali","cross_cats":["cs.DS","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-27T10:28:12Z","title":"Exponentiated Subgradient Algorithm for Online Optimization under the Random Permutation Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7171","kind":"arxiv","version":2},"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:02e690ce435814a8c2eedc1d14dfcc901b35701e9c347ab1a9b17197ce939ade","target":"record","created_at":"2026-05-18T02:27:56Z","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":"dfdfada390dda8a211242b96f20a21de467a2669d1262373242692d462697172","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-27T10:28:12Z","title_canon_sha256":"c7bd25c296b200a9910288accf8f8318ae5ae46bf6a79dc35311eea7dbb16dfc"},"schema_version":"1.0","source":{"id":"1410.7171","kind":"arxiv","version":2}},"canonical_sha256":"6efa13701ff0c52e4f2f665fe2670f994e2f2ea77d77faf35eb181911f77eb2b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6efa13701ff0c52e4f2f665fe2670f994e2f2ea77d77faf35eb181911f77eb2b","first_computed_at":"2026-05-18T02:27:56.878565Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:56.878565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HyoW31rSIggT5hLQQyt6PKQLLxoD2GS67yenIoLk8tyygztJgL2TeS8hptP7YXTV70tv05TPA0V5Yaw1oLQrBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:56.879152Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.7171","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02e690ce435814a8c2eedc1d14dfcc901b35701e9c347ab1a9b17197ce939ade","sha256:f281c9ce5121c56ce322a020f3dd1b18c88041d3e12b9fd4b5632cc793472a30"],"state_sha256":"e705b1767f2458b59a30487b2aedd3206d2e3cf037a3dcddfd4c25d099c75d41"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"coMBWd+1biYNQ3Dky0qh+4LGaHClTEqBf8RvChuB9HtQG3Lz0osCGwy1q/7J0UZ3qWb45chKM72HEME/wCcQAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T16:30:36.635799Z","bundle_sha256":"c1004e6852622fa337b66a45fc71e997ce9d455aea879a315c6087584eeacb6f"}}