{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:X5HDUMRJ6MIFEDFQNIE3V3KWP3","short_pith_number":"pith:X5HDUMRJ","canonical_record":{"source":{"id":"2202.02975","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2022-02-07T07:02:41Z","cross_cats_sorted":[],"title_canon_sha256":"930a46a69ad668bacbf0a8a2a7e6a2eee3ebf6815300bfe24fa05156d8b1a70f","abstract_canon_sha256":"0b95b06953b5a06bcfbf071f60899647f5d8336f96b7f4db1cdb94bb6f25b601"},"schema_version":"1.0"},"canonical_sha256":"bf4e3a3229f310520cb06a09baed567efd8228fe136aaa70fd775b23cc9ae27f","source":{"kind":"arxiv","id":"2202.02975","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.02975","created_at":"2026-07-05T03:54:34Z"},{"alias_kind":"arxiv_version","alias_value":"2202.02975v1","created_at":"2026-07-05T03:54:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.02975","created_at":"2026-07-05T03:54:34Z"},{"alias_kind":"pith_short_12","alias_value":"X5HDUMRJ6MIF","created_at":"2026-07-05T03:54:34Z"},{"alias_kind":"pith_short_16","alias_value":"X5HDUMRJ6MIFEDFQ","created_at":"2026-07-05T03:54:34Z"},{"alias_kind":"pith_short_8","alias_value":"X5HDUMRJ","created_at":"2026-07-05T03:54:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:X5HDUMRJ6MIFEDFQNIE3V3KWP3","target":"record","payload":{"canonical_record":{"source":{"id":"2202.02975","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2022-02-07T07:02:41Z","cross_cats_sorted":[],"title_canon_sha256":"930a46a69ad668bacbf0a8a2a7e6a2eee3ebf6815300bfe24fa05156d8b1a70f","abstract_canon_sha256":"0b95b06953b5a06bcfbf071f60899647f5d8336f96b7f4db1cdb94bb6f25b601"},"schema_version":"1.0"},"canonical_sha256":"bf4e3a3229f310520cb06a09baed567efd8228fe136aaa70fd775b23cc9ae27f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:54:34.646377Z","signature_b64":"twPciGBRE7wmPLAuSUigS0WqxnFkG/7Xxd61w1qRGYnfbJiAlRM2Kz9hoa5/CIaXW5EJsxZV18c0k9lx/ftIBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf4e3a3229f310520cb06a09baed567efd8228fe136aaa70fd775b23cc9ae27f","last_reissued_at":"2026-07-05T03:54:34.645984Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:54:34.645984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2202.02975","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-07-05T03:54:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tyW5sswYIVkSGB0PV3OTc6Irqvn7k9WsDqnftaq870SW9kgD1jtlSW8yvBoSIMPoGVC9vCzz6ExTUGLJQoWUDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T07:38:14.584220Z"},"content_sha256":"9291af064e3f8af01db925498cbf2704c306a2507e253fbd88dbc227c5df7f65","schema_version":"1.0","event_id":"sha256:9291af064e3f8af01db925498cbf2704c306a2507e253fbd88dbc227c5df7f65"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:X5HDUMRJ6MIFEDFQNIE3V3KWP3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Competitive Online Optimization with Multiple Inventories: A Divide-and-Conquer Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PF","authors_text":"Junyan Su, Minghua Chen, Qiulin Lin, Yanfang Mo","submitted_at":"2022-02-07T07:02:41Z","abstract_excerpt":"We study a competitive online optimization problem with multiple inventories. In the problem, an online decision maker seeks to optimize the allocation of multiple capacity-limited inventories over a slotted horizon, while the allocation constraints and revenue function come online at each slot. The problem is challenging as we need to allocate limited inventories under adversarial revenue functions and allocation constraints, while our decisions are coupled among multiple inventories and different slots. We propose a divide-and-conquer approach that allows us to decompose the problem into sev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.02975","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2202.02975/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:54:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aW4Dh65Zo44qNELMIYvBqbxJZzRHCYP6wJ9gzD9ANNwjRqivzYKPvvOLjaQBiNs80mDuywrrz/R6Q5CBmM4mBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T07:38:14.585366Z"},"content_sha256":"952dc86910ddad3a9d1ebd8d65f325c071420b058890bb3a2be9fc39c990afa1","schema_version":"1.0","event_id":"sha256:952dc86910ddad3a9d1ebd8d65f325c071420b058890bb3a2be9fc39c990afa1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X5HDUMRJ6MIFEDFQNIE3V3KWP3/bundle.json","state_url":"https://pith.science/pith/X5HDUMRJ6MIFEDFQNIE3V3KWP3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X5HDUMRJ6MIFEDFQNIE3V3KWP3/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-08-05T07:38:14Z","links":{"resolver":"https://pith.science/pith/X5HDUMRJ6MIFEDFQNIE3V3KWP3","bundle":"https://pith.science/pith/X5HDUMRJ6MIFEDFQNIE3V3KWP3/bundle.json","state":"https://pith.science/pith/X5HDUMRJ6MIFEDFQNIE3V3KWP3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X5HDUMRJ6MIFEDFQNIE3V3KWP3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:X5HDUMRJ6MIFEDFQNIE3V3KWP3","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":"0b95b06953b5a06bcfbf071f60899647f5d8336f96b7f4db1cdb94bb6f25b601","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2022-02-07T07:02:41Z","title_canon_sha256":"930a46a69ad668bacbf0a8a2a7e6a2eee3ebf6815300bfe24fa05156d8b1a70f"},"schema_version":"1.0","source":{"id":"2202.02975","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.02975","created_at":"2026-07-05T03:54:34Z"},{"alias_kind":"arxiv_version","alias_value":"2202.02975v1","created_at":"2026-07-05T03:54:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.02975","created_at":"2026-07-05T03:54:34Z"},{"alias_kind":"pith_short_12","alias_value":"X5HDUMRJ6MIF","created_at":"2026-07-05T03:54:34Z"},{"alias_kind":"pith_short_16","alias_value":"X5HDUMRJ6MIFEDFQ","created_at":"2026-07-05T03:54:34Z"},{"alias_kind":"pith_short_8","alias_value":"X5HDUMRJ","created_at":"2026-07-05T03:54:34Z"}],"graph_snapshots":[{"event_id":"sha256:952dc86910ddad3a9d1ebd8d65f325c071420b058890bb3a2be9fc39c990afa1","target":"graph","created_at":"2026-07-05T03:54:34Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2202.02975/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study a competitive online optimization problem with multiple inventories. In the problem, an online decision maker seeks to optimize the allocation of multiple capacity-limited inventories over a slotted horizon, while the allocation constraints and revenue function come online at each slot. The problem is challenging as we need to allocate limited inventories under adversarial revenue functions and allocation constraints, while our decisions are coupled among multiple inventories and different slots. We propose a divide-and-conquer approach that allows us to decompose the problem into sev","authors_text":"Junyan Su, Minghua Chen, Qiulin Lin, Yanfang Mo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2022-02-07T07:02:41Z","title":"Competitive Online Optimization with Multiple Inventories: A Divide-and-Conquer Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.02975","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:9291af064e3f8af01db925498cbf2704c306a2507e253fbd88dbc227c5df7f65","target":"record","created_at":"2026-07-05T03:54:34Z","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":"0b95b06953b5a06bcfbf071f60899647f5d8336f96b7f4db1cdb94bb6f25b601","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2022-02-07T07:02:41Z","title_canon_sha256":"930a46a69ad668bacbf0a8a2a7e6a2eee3ebf6815300bfe24fa05156d8b1a70f"},"schema_version":"1.0","source":{"id":"2202.02975","kind":"arxiv","version":1}},"canonical_sha256":"bf4e3a3229f310520cb06a09baed567efd8228fe136aaa70fd775b23cc9ae27f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf4e3a3229f310520cb06a09baed567efd8228fe136aaa70fd775b23cc9ae27f","first_computed_at":"2026-07-05T03:54:34.645984Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:54:34.645984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"twPciGBRE7wmPLAuSUigS0WqxnFkG/7Xxd61w1qRGYnfbJiAlRM2Kz9hoa5/CIaXW5EJsxZV18c0k9lx/ftIBA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:54:34.646377Z","signed_message":"canonical_sha256_bytes"},"source_id":"2202.02975","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9291af064e3f8af01db925498cbf2704c306a2507e253fbd88dbc227c5df7f65","sha256:952dc86910ddad3a9d1ebd8d65f325c071420b058890bb3a2be9fc39c990afa1"],"state_sha256":"82b34db6b65b4ec2158b611675256bf5947827f95f72cd6689dea75a4fbb7f2e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qe2YPCOsMuQ3vDT+cH1B4L3zHqWEzPAsKUWu8nk6e4WLb7kIGp5QkpkJZdi/KIFblh67VLY6jpwD3hQVxXMaDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T07:38:14.593332Z","bundle_sha256":"dc398e85f96e7603a68fbddb79f02fb8dbc953f557b5d2ca895e41e6885a5573"}}