{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:5BU3YBMHLGNWNL6ZBUCJMAZUXI","short_pith_number":"pith:5BU3YBMH","canonical_record":{"source":{"id":"1511.09293","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-30T13:11:47Z","cross_cats_sorted":[],"title_canon_sha256":"629e8a8ba6939858004c2757bd06cbef7d55c542b9de41da0c71eefe37e0287f","abstract_canon_sha256":"7f66ea506766179f54657e889ef6178058fe3ce86bee9fe00d0ceeeaa00676b1"},"schema_version":"1.0"},"canonical_sha256":"e869bc0587599b66afd90d04960334ba23c908cc44301999ec7d4c46a4cdf62f","source":{"kind":"arxiv","id":"1511.09293","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.09293","created_at":"2026-05-18T01:25:40Z"},{"alias_kind":"arxiv_version","alias_value":"1511.09293v1","created_at":"2026-05-18T01:25:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.09293","created_at":"2026-05-18T01:25:40Z"},{"alias_kind":"pith_short_12","alias_value":"5BU3YBMHLGNW","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5BU3YBMHLGNWNL6Z","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5BU3YBMH","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:5BU3YBMHLGNWNL6ZBUCJMAZUXI","target":"record","payload":{"canonical_record":{"source":{"id":"1511.09293","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-30T13:11:47Z","cross_cats_sorted":[],"title_canon_sha256":"629e8a8ba6939858004c2757bd06cbef7d55c542b9de41da0c71eefe37e0287f","abstract_canon_sha256":"7f66ea506766179f54657e889ef6178058fe3ce86bee9fe00d0ceeeaa00676b1"},"schema_version":"1.0"},"canonical_sha256":"e869bc0587599b66afd90d04960334ba23c908cc44301999ec7d4c46a4cdf62f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:40.618061Z","signature_b64":"kfb/A+7gKCRUTZ4AByVkTRcYXbWHkLdoycu9ej/0TdWXfi2PAc+aP7Ne89hV5vEMadiakJpuM4jK90dCAfgXCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e869bc0587599b66afd90d04960334ba23c908cc44301999ec7d4c46a4cdf62f","last_reissued_at":"2026-05-18T01:25:40.617399Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:40.617399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.09293","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-05-18T01:25:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K8oROiFvmpduJzlbxtvW5VK9ZTcmYTcIwRCatikpgGJp1KFIAou+YtBD1eI5BsYa/vr+6PRxyxgcc/bpA/JKAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T15:41:19.583985Z"},"content_sha256":"b3050b6aaabc5559f43a9ff1e07d1677097a9f1d85f6d570da1b68883e0b98e4","schema_version":"1.0","event_id":"sha256:b3050b6aaabc5559f43a9ff1e07d1677097a9f1d85f6d570da1b68883e0b98e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:5BU3YBMHLGNWNL6ZBUCJMAZUXI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Improved Approximation Guarantee for the Maximum Budgeted Allocation Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christos Kalaitzis","submitted_at":"2015-11-30T13:11:47Z","abstract_excerpt":"We study the Maximum Budgeted Allocation problem, which is the problem of assigning indivisible items to players with budget constraints. In its most general form, an instance of the MBA problem might include many different prices for the same item among different players, and different budget constraints for every player. So far, the best approximation algorithms we know for the MBA problem achieve a $3/4$-approximation ratio, and employ a natural LP relaxation, called the Assignment-LP. In this paper, we give an algorithm for MBA, and prove that it achieves a $3/4+c$-approximation ratio, for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.09293","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":""},"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-05-18T01:25:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"swtH1jditCas35WmF1eW2DtAykgsggSmkmCIQWyKgIFdDE3w6/MQbkWZK2Rhc5f8pkg9jWZof2Z7yiahv4RHAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T15:41:19.584658Z"},"content_sha256":"17404d88f20839d0513e3be3082fff375680c6795d238ecb96821fb9aa5ee026","schema_version":"1.0","event_id":"sha256:17404d88f20839d0513e3be3082fff375680c6795d238ecb96821fb9aa5ee026"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5BU3YBMHLGNWNL6ZBUCJMAZUXI/bundle.json","state_url":"https://pith.science/pith/5BU3YBMHLGNWNL6ZBUCJMAZUXI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5BU3YBMHLGNWNL6ZBUCJMAZUXI/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-06-07T15:41:19Z","links":{"resolver":"https://pith.science/pith/5BU3YBMHLGNWNL6ZBUCJMAZUXI","bundle":"https://pith.science/pith/5BU3YBMHLGNWNL6ZBUCJMAZUXI/bundle.json","state":"https://pith.science/pith/5BU3YBMHLGNWNL6ZBUCJMAZUXI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5BU3YBMHLGNWNL6ZBUCJMAZUXI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5BU3YBMHLGNWNL6ZBUCJMAZUXI","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":"7f66ea506766179f54657e889ef6178058fe3ce86bee9fe00d0ceeeaa00676b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-30T13:11:47Z","title_canon_sha256":"629e8a8ba6939858004c2757bd06cbef7d55c542b9de41da0c71eefe37e0287f"},"schema_version":"1.0","source":{"id":"1511.09293","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.09293","created_at":"2026-05-18T01:25:40Z"},{"alias_kind":"arxiv_version","alias_value":"1511.09293v1","created_at":"2026-05-18T01:25:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.09293","created_at":"2026-05-18T01:25:40Z"},{"alias_kind":"pith_short_12","alias_value":"5BU3YBMHLGNW","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5BU3YBMHLGNWNL6Z","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5BU3YBMH","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:17404d88f20839d0513e3be3082fff375680c6795d238ecb96821fb9aa5ee026","target":"graph","created_at":"2026-05-18T01:25:40Z","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":"We study the Maximum Budgeted Allocation problem, which is the problem of assigning indivisible items to players with budget constraints. In its most general form, an instance of the MBA problem might include many different prices for the same item among different players, and different budget constraints for every player. So far, the best approximation algorithms we know for the MBA problem achieve a $3/4$-approximation ratio, and employ a natural LP relaxation, called the Assignment-LP. In this paper, we give an algorithm for MBA, and prove that it achieves a $3/4+c$-approximation ratio, for","authors_text":"Christos Kalaitzis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-30T13:11:47Z","title":"An Improved Approximation Guarantee for the Maximum Budgeted Allocation Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.09293","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:b3050b6aaabc5559f43a9ff1e07d1677097a9f1d85f6d570da1b68883e0b98e4","target":"record","created_at":"2026-05-18T01:25:40Z","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":"7f66ea506766179f54657e889ef6178058fe3ce86bee9fe00d0ceeeaa00676b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-30T13:11:47Z","title_canon_sha256":"629e8a8ba6939858004c2757bd06cbef7d55c542b9de41da0c71eefe37e0287f"},"schema_version":"1.0","source":{"id":"1511.09293","kind":"arxiv","version":1}},"canonical_sha256":"e869bc0587599b66afd90d04960334ba23c908cc44301999ec7d4c46a4cdf62f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e869bc0587599b66afd90d04960334ba23c908cc44301999ec7d4c46a4cdf62f","first_computed_at":"2026-05-18T01:25:40.617399Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:40.617399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kfb/A+7gKCRUTZ4AByVkTRcYXbWHkLdoycu9ej/0TdWXfi2PAc+aP7Ne89hV5vEMadiakJpuM4jK90dCAfgXCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:40.618061Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.09293","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3050b6aaabc5559f43a9ff1e07d1677097a9f1d85f6d570da1b68883e0b98e4","sha256:17404d88f20839d0513e3be3082fff375680c6795d238ecb96821fb9aa5ee026"],"state_sha256":"9d864c082dd0b9fca723689cbc96ae6e5fe340d6a8c3561eebb5c8d9e6aaea8d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nLnWDlm64l2G7JUu3RAe1E2WKAj/iduIoUa0svIBaZZ3F9Z3W8mRBfHlVfFnSaJLlHIT4o7VGxwu0m/e0bE6Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T15:41:19.588181Z","bundle_sha256":"82ae4ae4c2c6d924e0ee4dcc03d1062fa82310869ff1b15142329de0fd283825"}}