{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MTGP6VNNOZXE7NJBATHWTOEODK","short_pith_number":"pith:MTGP6VNN","schema_version":"1.0","canonical_sha256":"64ccff55ad766e4fb52104cf69b88e1ab44aed93d74924f83819d893c09f5af2","source":{"kind":"arxiv","id":"1611.08060","version":1},"attestation_state":"computed","paper":{"title":"On ($1$, $\\epsilon$)-Restricted Max-Min Fair Allocation Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"T-H. Hubert Chan, Xiaowei Wu, Zhihao Gavin Tang","submitted_at":"2016-11-24T03:41:19Z","abstract_excerpt":"We study the max-min fair allocation problem in which a set of $m$ indivisible items are to be distributed among $n$ agents such that the minimum utility among all agents is maximized. In the restricted setting, the utility of each item $j$ on agent $i$ is either $0$ or some non-negative weight $w_j$. For this setting, Asadpour et al. showed that a certain configuration-LP can be used to estimate the optimal value within a factor of $4+\\delta$, for any $\\delta>0$, which was recently extended by Annamalai et al. to give a polynomial-time $13$-approximation algorithm for the problem. For hardnes"},"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":"1611.08060","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-24T03:41:19Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f86725728f170f566075b9ae43773d449ac1973bb65ad0eff02ff3f5b52b11a2","abstract_canon_sha256":"a0100431aa58ae0cc8a09f69d7c35afafad4204eb0396206aff2c7e19e526bdb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:44.554256Z","signature_b64":"gf8ZKHW35oZPkTMMGwqQP6BNi6SFO9sC0MDd+UXSfVK8ySwSouMH3BETVIJ/HYYlRLC6Eozvtj8O+a8r6EsEAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64ccff55ad766e4fb52104cf69b88e1ab44aed93d74924f83819d893c09f5af2","last_reissued_at":"2026-05-18T00:56:44.553372Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:44.553372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On ($1$, $\\epsilon$)-Restricted Max-Min Fair Allocation Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"T-H. Hubert Chan, Xiaowei Wu, Zhihao Gavin Tang","submitted_at":"2016-11-24T03:41:19Z","abstract_excerpt":"We study the max-min fair allocation problem in which a set of $m$ indivisible items are to be distributed among $n$ agents such that the minimum utility among all agents is maximized. In the restricted setting, the utility of each item $j$ on agent $i$ is either $0$ or some non-negative weight $w_j$. For this setting, Asadpour et al. showed that a certain configuration-LP can be used to estimate the optimal value within a factor of $4+\\delta$, for any $\\delta>0$, which was recently extended by Annamalai et al. to give a polynomial-time $13$-approximation algorithm for the problem. For hardnes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08060","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1611.08060","created_at":"2026-05-18T00:56:44.553489+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.08060v1","created_at":"2026-05-18T00:56:44.553489+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08060","created_at":"2026-05-18T00:56:44.553489+00:00"},{"alias_kind":"pith_short_12","alias_value":"MTGP6VNNOZXE","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MTGP6VNNOZXE7NJB","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MTGP6VNN","created_at":"2026-05-18T12:30:32.724797+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/MTGP6VNNOZXE7NJBATHWTOEODK","json":"https://pith.science/pith/MTGP6VNNOZXE7NJBATHWTOEODK.json","graph_json":"https://pith.science/api/pith-number/MTGP6VNNOZXE7NJBATHWTOEODK/graph.json","events_json":"https://pith.science/api/pith-number/MTGP6VNNOZXE7NJBATHWTOEODK/events.json","paper":"https://pith.science/paper/MTGP6VNN"},"agent_actions":{"view_html":"https://pith.science/pith/MTGP6VNNOZXE7NJBATHWTOEODK","download_json":"https://pith.science/pith/MTGP6VNNOZXE7NJBATHWTOEODK.json","view_paper":"https://pith.science/paper/MTGP6VNN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.08060&json=true","fetch_graph":"https://pith.science/api/pith-number/MTGP6VNNOZXE7NJBATHWTOEODK/graph.json","fetch_events":"https://pith.science/api/pith-number/MTGP6VNNOZXE7NJBATHWTOEODK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MTGP6VNNOZXE7NJBATHWTOEODK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MTGP6VNNOZXE7NJBATHWTOEODK/action/storage_attestation","attest_author":"https://pith.science/pith/MTGP6VNNOZXE7NJBATHWTOEODK/action/author_attestation","sign_citation":"https://pith.science/pith/MTGP6VNNOZXE7NJBATHWTOEODK/action/citation_signature","submit_replication":"https://pith.science/pith/MTGP6VNNOZXE7NJBATHWTOEODK/action/replication_record"}},"created_at":"2026-05-18T00:56:44.553489+00:00","updated_at":"2026-05-18T00:56:44.553489+00:00"}