{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:YDVPYUZXRIGEQDG2EKPWB2KR6D","short_pith_number":"pith:YDVPYUZX","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"},"canonical_sha256":"c0eafc53378a0c480cda229f60e951f0ef6a9c13b0052915d43a92d8e4593f9a","source":{"kind":"arxiv","id":"2406.07757","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.07757","created_at":"2026-07-05T08:30:38Z"},{"alias_kind":"arxiv_version","alias_value":"2406.07757v1","created_at":"2026-07-05T08:30:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.07757","created_at":"2026-07-05T08:30:38Z"},{"alias_kind":"pith_short_12","alias_value":"YDVPYUZXRIGE","created_at":"2026-07-05T08:30:38Z"},{"alias_kind":"pith_short_16","alias_value":"YDVPYUZXRIGEQDG2","created_at":"2026-07-05T08:30:38Z"},{"alias_kind":"pith_short_8","alias_value":"YDVPYUZX","created_at":"2026-07-05T08:30:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:YDVPYUZXRIGEQDG2EKPWB2KR6D","target":"record","payload":{"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"},"canonical_sha256":"c0eafc53378a0c480cda229f60e951f0ef6a9c13b0052915d43a92d8e4593f9a","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"},"source_kind":"arxiv","source_id":"2406.07757","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-05T08:30:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MAhbrZdKK8Xs4bDTyDOvxoFuYoQPfl5M9Tz+nE3Zq/RPwnJ/r9Y2NeUI8gDZxgI7Vb2jC/2H2WIRp1cpHTegAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T08:10:42.264139Z"},"content_sha256":"d31a1a18ba43cef8a40d3869374ea42c34ab3700c5795ea066503130ececcc1c","schema_version":"1.0","event_id":"sha256:d31a1a18ba43cef8a40d3869374ea42c34ab3700c5795ea066503130ececcc1c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:YDVPYUZXRIGEQDG2EKPWB2KR6D","target":"graph","payload":{"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"},"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-05T08:30:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xmsZLyBBjFiHMSa4ikJ5Ac5AqlsPSk3m3EMuhO1jyufLZpFfj9lV9OLlVMF3TR3vRIEzFy5izcwLjLLxV6a2BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T08:10:42.264652Z"},"content_sha256":"0bdec599815cc98d77e7d20fae69a79cbe5106e43c670d4f11fcc30ed9ff8e11","schema_version":"1.0","event_id":"sha256:0bdec599815cc98d77e7d20fae69a79cbe5106e43c670d4f11fcc30ed9ff8e11"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YDVPYUZXRIGEQDG2EKPWB2KR6D/bundle.json","state_url":"https://pith.science/pith/YDVPYUZXRIGEQDG2EKPWB2KR6D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YDVPYUZXRIGEQDG2EKPWB2KR6D/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-07T08:10:42Z","links":{"resolver":"https://pith.science/pith/YDVPYUZXRIGEQDG2EKPWB2KR6D","bundle":"https://pith.science/pith/YDVPYUZXRIGEQDG2EKPWB2KR6D/bundle.json","state":"https://pith.science/pith/YDVPYUZXRIGEQDG2EKPWB2KR6D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YDVPYUZXRIGEQDG2EKPWB2KR6D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:YDVPYUZXRIGEQDG2EKPWB2KR6D","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":"d65c50430ae97cf9886bb5357c7bd169d46a6ff63c0739e303bb15d8821520a6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-06-11T22:37:41Z","title_canon_sha256":"7d33705324c2fc31829a4985332e4ce5a7de85c62bedc1f0c42ce432178b494b"},"schema_version":"1.0","source":{"id":"2406.07757","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.07757","created_at":"2026-07-05T08:30:38Z"},{"alias_kind":"arxiv_version","alias_value":"2406.07757v1","created_at":"2026-07-05T08:30:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.07757","created_at":"2026-07-05T08:30:38Z"},{"alias_kind":"pith_short_12","alias_value":"YDVPYUZXRIGE","created_at":"2026-07-05T08:30:38Z"},{"alias_kind":"pith_short_16","alias_value":"YDVPYUZXRIGEQDG2","created_at":"2026-07-05T08:30:38Z"},{"alias_kind":"pith_short_8","alias_value":"YDVPYUZX","created_at":"2026-07-05T08:30:38Z"}],"graph_snapshots":[{"event_id":"sha256:0bdec599815cc98d77e7d20fae69a79cbe5106e43c670d4f11fcc30ed9ff8e11","target":"graph","created_at":"2026-07-05T08:30:38Z","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/2406.07757/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Alexander Braun, Amin Saberi, Thomas Kesselheim, Tristan Pollner","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-06-11T22:37:41Z","title":"Approximating Optimum Online for Capacitated Resource Allocation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.07757","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:d31a1a18ba43cef8a40d3869374ea42c34ab3700c5795ea066503130ececcc1c","target":"record","created_at":"2026-07-05T08:30:38Z","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":"d65c50430ae97cf9886bb5357c7bd169d46a6ff63c0739e303bb15d8821520a6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-06-11T22:37:41Z","title_canon_sha256":"7d33705324c2fc31829a4985332e4ce5a7de85c62bedc1f0c42ce432178b494b"},"schema_version":"1.0","source":{"id":"2406.07757","kind":"arxiv","version":1}},"canonical_sha256":"c0eafc53378a0c480cda229f60e951f0ef6a9c13b0052915d43a92d8e4593f9a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0eafc53378a0c480cda229f60e951f0ef6a9c13b0052915d43a92d8e4593f9a","first_computed_at":"2026-07-05T08:30:38.021684Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:30:38.021684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pPxsbX5fuEX86sI5EmheS92gPL/Vk2qY35Aju1jQjzLKKpabyQwoulrsNgzk5Ha7VUdaxldfVUZ4VDc5AOKFCA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:30:38.022125Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.07757","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d31a1a18ba43cef8a40d3869374ea42c34ab3700c5795ea066503130ececcc1c","sha256:0bdec599815cc98d77e7d20fae69a79cbe5106e43c670d4f11fcc30ed9ff8e11"],"state_sha256":"4d8924f3a4144a6d1837414f0c0e5b10836d4d30f328bd4140f3c8b0c8025dad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/q66D+BONBgLn+EgG+uHKWAT49MxIsokbaCxoV/bxdWa/XaUEFvBWnenb0uM/ew6QQ2HhBDaCoYSfM2TIC5aDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T08:10:42.268637Z","bundle_sha256":"4171fe8bc00addf55f2394aa31f96b5a99c72d410cf1cb6eaa29308dc7a69766"}}