{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QCS5GPYBEF2FDK6ULSHH4XQKEB","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":"60a2cc4aef427ff0ecdc7e370c156043c7e8863bd6b47393c6cf6b01af8ffbb4","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-13T14:22:13Z","title_canon_sha256":"e6603b85ec764fa88546b30b634a8e96c98bae1f3654b734da7ac7a0f1de660a"},"schema_version":"1.0","source":{"id":"1208.2596","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.2596","created_at":"2026-05-18T02:21:01Z"},{"alias_kind":"arxiv_version","alias_value":"1208.2596v1","created_at":"2026-05-18T02:21:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.2596","created_at":"2026-05-18T02:21:01Z"},{"alias_kind":"pith_short_12","alias_value":"QCS5GPYBEF2F","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QCS5GPYBEF2FDK6U","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QCS5GPYB","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:4e160564de4c58282ce1212fcf9f7284528e73f76bf76ce08f32990dde1c7a63","target":"graph","created_at":"2026-05-18T02:21:01Z","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":"In this paper, we study a general online linear programming problem whose formulation encompasses many practical dynamic resource allocation problems, including internet advertising display applications, revenue management, various routing, packing, and auction problems. We propose a model, which under mild assumptions, allows us to design near-optimal learning-based online algorithms that do not require the a priori knowledge about the total number of online requests to come, a first of its kind. We then consider two variants of the problem that relax the initial assumptions imposed on the pr","authors_text":"Patrick Jaillet, Xin Lu","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-13T14:22:13Z","title":"Near-Optimal Online Algorithms for Dynamic Resource Allocation Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.2596","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:d5d669d2443656f777107ea5fa8fe6a39c8a7f1491008727dedc391b8549c224","target":"record","created_at":"2026-05-18T02:21:01Z","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":"60a2cc4aef427ff0ecdc7e370c156043c7e8863bd6b47393c6cf6b01af8ffbb4","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-13T14:22:13Z","title_canon_sha256":"e6603b85ec764fa88546b30b634a8e96c98bae1f3654b734da7ac7a0f1de660a"},"schema_version":"1.0","source":{"id":"1208.2596","kind":"arxiv","version":1}},"canonical_sha256":"80a5d33f01217451abd45c8e7e5e0a206f52320bd6014fcd07cdc83396255188","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"80a5d33f01217451abd45c8e7e5e0a206f52320bd6014fcd07cdc83396255188","first_computed_at":"2026-05-18T02:21:01.182215Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:01.182215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s5VAMEv67TFB8Uzj0bMOaVvTvv1iisamfswLmH90i5Ebo6sm4L0fqUb0y4DAKJAlxMr2ERgTicfCY50+OsSAAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:01.182906Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.2596","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5d669d2443656f777107ea5fa8fe6a39c8a7f1491008727dedc391b8549c224","sha256:4e160564de4c58282ce1212fcf9f7284528e73f76bf76ce08f32990dde1c7a63"],"state_sha256":"9901fe66dd3dd61494f5258f5ff351dd2cbb95fa298b31dc83694dbdbf43a886"}