{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:QHAPS23BQOFFK372N42Y46WOD3","short_pith_number":"pith:QHAPS23B","schema_version":"1.0","canonical_sha256":"81c0f96b61838a556ffa6f358e7ace1ed333431e4ed7f999c72a492e5630d83e","source":{"kind":"arxiv","id":"2402.13530","version":2},"attestation_state":"computed","paper":{"title":"Best of Many in Both Worlds: Online Resource Allocation with Predictions under Unknown Arrival Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Andrew A. Li, Benjamin Moseley, Gabriel Visotsky, Lin An","submitted_at":"2024-02-21T04:57:32Z","abstract_excerpt":"Online decision-makers often obtain predictions on future variables, such as arrivals, demands, inventories, and so on. These predictions can be generated from simple forecasting algorithms for univariate time-series, all the way to state-of-the-art machine learning models that leverage multiple time-series and additional feature information. However, the prediction accuracy is unknown to decision-makers a priori, hence blindly following the predictions can be harmful. In this paper, we address this problem by developing algorithms that utilize predictions in a manner that is robust to the unk"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2402.13530","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-02-21T04:57:32Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ca36aa47c231d580f49e61b9409eb154c83e794cf6b9fdff3e26227aed3b00e1","abstract_canon_sha256":"7fe38925ca7dda0a4158da9ceb80b576e302e685b91065e71c214486394ba51e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:35:42.160929Z","signature_b64":"p9lP+GLlvur1mq111VOjOjguLgcCc2hWXE+5ZTT/5TYqGmh5/dDFBKomjUJAXOviIlzmgu0O8RbJwhDHw3QpDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81c0f96b61838a556ffa6f358e7ace1ed333431e4ed7f999c72a492e5630d83e","last_reissued_at":"2026-07-05T08:35:42.160499Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:35:42.160499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Best of Many in Both Worlds: Online Resource Allocation with Predictions under Unknown Arrival Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Andrew A. Li, Benjamin Moseley, Gabriel Visotsky, Lin An","submitted_at":"2024-02-21T04:57:32Z","abstract_excerpt":"Online decision-makers often obtain predictions on future variables, such as arrivals, demands, inventories, and so on. These predictions can be generated from simple forecasting algorithms for univariate time-series, all the way to state-of-the-art machine learning models that leverage multiple time-series and additional feature information. However, the prediction accuracy is unknown to decision-makers a priori, hence blindly following the predictions can be harmful. In this paper, we address this problem by developing algorithms that utilize predictions in a manner that is robust to the unk"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.13530","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2402.13530/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2402.13530","created_at":"2026-07-05T08:35:42.160554+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.13530v2","created_at":"2026-07-05T08:35:42.160554+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.13530","created_at":"2026-07-05T08:35:42.160554+00:00"},{"alias_kind":"pith_short_12","alias_value":"QHAPS23BQOFF","created_at":"2026-07-05T08:35:42.160554+00:00"},{"alias_kind":"pith_short_16","alias_value":"QHAPS23BQOFFK372","created_at":"2026-07-05T08:35:42.160554+00:00"},{"alias_kind":"pith_short_8","alias_value":"QHAPS23B","created_at":"2026-07-05T08:35:42.160554+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08262","citing_title":"Primal-Dual Online Algorithms for the Parking Permit Problem","ref_index":34,"is_internal_anchor":true},{"citing_arxiv_id":"2606.05380","citing_title":"Learning-Augmented Online Minimization with Dual Predictions","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QHAPS23BQOFFK372N42Y46WOD3","json":"https://pith.science/pith/QHAPS23BQOFFK372N42Y46WOD3.json","graph_json":"https://pith.science/api/pith-number/QHAPS23BQOFFK372N42Y46WOD3/graph.json","events_json":"https://pith.science/api/pith-number/QHAPS23BQOFFK372N42Y46WOD3/events.json","paper":"https://pith.science/paper/QHAPS23B"},"agent_actions":{"view_html":"https://pith.science/pith/QHAPS23BQOFFK372N42Y46WOD3","download_json":"https://pith.science/pith/QHAPS23BQOFFK372N42Y46WOD3.json","view_paper":"https://pith.science/paper/QHAPS23B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.13530&json=true","fetch_graph":"https://pith.science/api/pith-number/QHAPS23BQOFFK372N42Y46WOD3/graph.json","fetch_events":"https://pith.science/api/pith-number/QHAPS23BQOFFK372N42Y46WOD3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QHAPS23BQOFFK372N42Y46WOD3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QHAPS23BQOFFK372N42Y46WOD3/action/storage_attestation","attest_author":"https://pith.science/pith/QHAPS23BQOFFK372N42Y46WOD3/action/author_attestation","sign_citation":"https://pith.science/pith/QHAPS23BQOFFK372N42Y46WOD3/action/citation_signature","submit_replication":"https://pith.science/pith/QHAPS23BQOFFK372N42Y46WOD3/action/replication_record"}},"created_at":"2026-07-05T08:35:42.160554+00:00","updated_at":"2026-07-05T08:35:42.160554+00:00"}