{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:YDVPYUZXRIGEQDG2EKPWB2KR6D","short_pith_number":"pith:YDVPYUZX","schema_version":"1.0","canonical_sha256":"c0eafc53378a0c480cda229f60e951f0ef6a9c13b0052915d43a92d8e4593f9a","source":{"kind":"arxiv","id":"2406.07757","version":1},"attestation_state":"computed","paper":{"title":"Approximating Optimum Online for Capacitated Resource Allocation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander Braun, Amin Saberi, Thomas Kesselheim, Tristan Pollner","submitted_at":"2024-06-11T22:37:41Z","abstract_excerpt":"We study online capacitated resource allocation, a natural generalization of online stochastic max-weight bipartite matching. This problem is motivated by ride-sharing and Internet advertising applications, where online arrivals may have the capacity to serve multiple offline users.\n  Our main result is a polynomial-time online algorithm which is $(1/2 + \\kappa)$-approximate to the optimal online algorithm for $\\kappa = 0.0115$. This can be contrasted to the (tight) $1/2$-competitive algorithms to the optimum offline benchmark from the prophet inequality literature. Optimum online is a recentl"},"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":"2406.07757","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-06-11T22:37:41Z","cross_cats_sorted":[],"title_canon_sha256":"7d33705324c2fc31829a4985332e4ce5a7de85c62bedc1f0c42ce432178b494b","abstract_canon_sha256":"d65c50430ae97cf9886bb5357c7bd169d46a6ff63c0739e303bb15d8821520a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:30:38.022125Z","signature_b64":"pPxsbX5fuEX86sI5EmheS92gPL/Vk2qY35Aju1jQjzLKKpabyQwoulrsNgzk5Ha7VUdaxldfVUZ4VDc5AOKFCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0eafc53378a0c480cda229f60e951f0ef6a9c13b0052915d43a92d8e4593f9a","last_reissued_at":"2026-07-05T08:30:38.021684Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:30:38.021684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating Optimum Online for Capacitated Resource Allocation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander Braun, Amin Saberi, Thomas Kesselheim, Tristan Pollner","submitted_at":"2024-06-11T22:37:41Z","abstract_excerpt":"We study online capacitated resource allocation, a natural generalization of online stochastic max-weight bipartite matching. This problem is motivated by ride-sharing and Internet advertising applications, where online arrivals may have the capacity to serve multiple offline users.\n  Our main result is a polynomial-time online algorithm which is $(1/2 + \\kappa)$-approximate to the optimal online algorithm for $\\kappa = 0.0115$. This can be contrasted to the (tight) $1/2$-competitive algorithms to the optimum offline benchmark from the prophet inequality literature. Optimum online is a recentl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.07757","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/2406.07757/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":"2406.07757","created_at":"2026-07-05T08:30:38.021737+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.07757v1","created_at":"2026-07-05T08:30:38.021737+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.07757","created_at":"2026-07-05T08:30:38.021737+00:00"},{"alias_kind":"pith_short_12","alias_value":"YDVPYUZXRIGE","created_at":"2026-07-05T08:30:38.021737+00:00"},{"alias_kind":"pith_short_16","alias_value":"YDVPYUZXRIGEQDG2","created_at":"2026-07-05T08:30:38.021737+00:00"},{"alias_kind":"pith_short_8","alias_value":"YDVPYUZX","created_at":"2026-07-05T08:30:38.021737+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YDVPYUZXRIGEQDG2EKPWB2KR6D","json":"https://pith.science/pith/YDVPYUZXRIGEQDG2EKPWB2KR6D.json","graph_json":"https://pith.science/api/pith-number/YDVPYUZXRIGEQDG2EKPWB2KR6D/graph.json","events_json":"https://pith.science/api/pith-number/YDVPYUZXRIGEQDG2EKPWB2KR6D/events.json","paper":"https://pith.science/paper/YDVPYUZX"},"agent_actions":{"view_html":"https://pith.science/pith/YDVPYUZXRIGEQDG2EKPWB2KR6D","download_json":"https://pith.science/pith/YDVPYUZXRIGEQDG2EKPWB2KR6D.json","view_paper":"https://pith.science/paper/YDVPYUZX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.07757&json=true","fetch_graph":"https://pith.science/api/pith-number/YDVPYUZXRIGEQDG2EKPWB2KR6D/graph.json","fetch_events":"https://pith.science/api/pith-number/YDVPYUZXRIGEQDG2EKPWB2KR6D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YDVPYUZXRIGEQDG2EKPWB2KR6D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YDVPYUZXRIGEQDG2EKPWB2KR6D/action/storage_attestation","attest_author":"https://pith.science/pith/YDVPYUZXRIGEQDG2EKPWB2KR6D/action/author_attestation","sign_citation":"https://pith.science/pith/YDVPYUZXRIGEQDG2EKPWB2KR6D/action/citation_signature","submit_replication":"https://pith.science/pith/YDVPYUZXRIGEQDG2EKPWB2KR6D/action/replication_record"}},"created_at":"2026-07-05T08:30:38.021737+00:00","updated_at":"2026-07-05T08:30:38.021737+00:00"}