{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GSEKNZODXAJV7GS7TRGU4WUTOA","short_pith_number":"pith:GSEKNZOD","schema_version":"1.0","canonical_sha256":"3488a6e5c3b8135f9a5f9c4d4e5a93702bb19509751dce43d898f3e56a6719fe","source":{"kind":"arxiv","id":"1804.10902","version":2},"attestation_state":"computed","paper":{"title":"Restricted Max-Min Fair Allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Siu-Wing Cheng, Yuchen Mao","submitted_at":"2018-04-29T10:22:39Z","abstract_excerpt":"The restricted max-min fair allocation problem seeks an allocation of resources to players that maximizes the minimum total value obtained by any player. It is NP-hard to approximate the problem to a ratio less than 2. Comparing the current best algorithm for estimating the optimal value with the current best for constructing an allocation, there is quite a gap between the ratios that can be achieved in polynomial time: roughly 4 for estimation and roughly $6 + 2\\sqrt{10}$ for construction. We propose an algorithm that constructs an allocation with value within a factor of $6 + \\delta$ from th"},"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":"1804.10902","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-29T10:22:39Z","cross_cats_sorted":[],"title_canon_sha256":"c1f098a991a08e642b544f060b642dde66122087926a4b7d7dc1a165bfe7574a","abstract_canon_sha256":"dab1d83854bce6d9fd4bc0ae5d9184ac63f5029a22de6a2b9e0d56c337058b3d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:35.773358Z","signature_b64":"Zl0VRFUgoecR2ZcSCwIQ/b5W01rVFJxtgzZ52Yd7Vn/vzMh/A6l+4eDYyW7DYYzKhkGP8KltBO2SlqlUY8AUCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3488a6e5c3b8135f9a5f9c4d4e5a93702bb19509751dce43d898f3e56a6719fe","last_reissued_at":"2026-05-18T00:08:35.772744Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:35.772744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Restricted Max-Min Fair Allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Siu-Wing Cheng, Yuchen Mao","submitted_at":"2018-04-29T10:22:39Z","abstract_excerpt":"The restricted max-min fair allocation problem seeks an allocation of resources to players that maximizes the minimum total value obtained by any player. It is NP-hard to approximate the problem to a ratio less than 2. Comparing the current best algorithm for estimating the optimal value with the current best for constructing an allocation, there is quite a gap between the ratios that can be achieved in polynomial time: roughly 4 for estimation and roughly $6 + 2\\sqrt{10}$ for construction. We propose an algorithm that constructs an allocation with value within a factor of $6 + \\delta$ from th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10902","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":""},"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":"1804.10902","created_at":"2026-05-18T00:08:35.772839+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.10902v2","created_at":"2026-05-18T00:08:35.772839+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10902","created_at":"2026-05-18T00:08:35.772839+00:00"},{"alias_kind":"pith_short_12","alias_value":"GSEKNZODXAJV","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GSEKNZODXAJV7GS7","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GSEKNZOD","created_at":"2026-05-18T12:32:25.280505+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/GSEKNZODXAJV7GS7TRGU4WUTOA","json":"https://pith.science/pith/GSEKNZODXAJV7GS7TRGU4WUTOA.json","graph_json":"https://pith.science/api/pith-number/GSEKNZODXAJV7GS7TRGU4WUTOA/graph.json","events_json":"https://pith.science/api/pith-number/GSEKNZODXAJV7GS7TRGU4WUTOA/events.json","paper":"https://pith.science/paper/GSEKNZOD"},"agent_actions":{"view_html":"https://pith.science/pith/GSEKNZODXAJV7GS7TRGU4WUTOA","download_json":"https://pith.science/pith/GSEKNZODXAJV7GS7TRGU4WUTOA.json","view_paper":"https://pith.science/paper/GSEKNZOD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.10902&json=true","fetch_graph":"https://pith.science/api/pith-number/GSEKNZODXAJV7GS7TRGU4WUTOA/graph.json","fetch_events":"https://pith.science/api/pith-number/GSEKNZODXAJV7GS7TRGU4WUTOA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GSEKNZODXAJV7GS7TRGU4WUTOA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GSEKNZODXAJV7GS7TRGU4WUTOA/action/storage_attestation","attest_author":"https://pith.science/pith/GSEKNZODXAJV7GS7TRGU4WUTOA/action/author_attestation","sign_citation":"https://pith.science/pith/GSEKNZODXAJV7GS7TRGU4WUTOA/action/citation_signature","submit_replication":"https://pith.science/pith/GSEKNZODXAJV7GS7TRGU4WUTOA/action/replication_record"}},"created_at":"2026-05-18T00:08:35.772839+00:00","updated_at":"2026-05-18T00:08:35.772839+00:00"}