{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MTGP6VNNOZXE7NJBATHWTOEODK","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":"a0100431aa58ae0cc8a09f69d7c35afafad4204eb0396206aff2c7e19e526bdb","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-24T03:41:19Z","title_canon_sha256":"f86725728f170f566075b9ae43773d449ac1973bb65ad0eff02ff3f5b52b11a2"},"schema_version":"1.0","source":{"id":"1611.08060","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.08060","created_at":"2026-05-18T00:56:44Z"},{"alias_kind":"arxiv_version","alias_value":"1611.08060v1","created_at":"2026-05-18T00:56:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08060","created_at":"2026-05-18T00:56:44Z"},{"alias_kind":"pith_short_12","alias_value":"MTGP6VNNOZXE","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MTGP6VNNOZXE7NJB","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MTGP6VNN","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:aaa697633e7ca12753bfa9284a1b9a788aabf2d9a57117d18a3fea3e88771d81","target":"graph","created_at":"2026-05-18T00:56:44Z","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 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","authors_text":"T-H. Hubert Chan, Xiaowei Wu, Zhihao Gavin Tang","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-24T03:41:19Z","title":"On ($1$, $\\epsilon$)-Restricted Max-Min Fair Allocation Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08060","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:39e9df715f71dbe69ce246845c6e0335a4699c7da9b39a431947967ef1784250","target":"record","created_at":"2026-05-18T00:56:44Z","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":"a0100431aa58ae0cc8a09f69d7c35afafad4204eb0396206aff2c7e19e526bdb","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-24T03:41:19Z","title_canon_sha256":"f86725728f170f566075b9ae43773d449ac1973bb65ad0eff02ff3f5b52b11a2"},"schema_version":"1.0","source":{"id":"1611.08060","kind":"arxiv","version":1}},"canonical_sha256":"64ccff55ad766e4fb52104cf69b88e1ab44aed93d74924f83819d893c09f5af2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64ccff55ad766e4fb52104cf69b88e1ab44aed93d74924f83819d893c09f5af2","first_computed_at":"2026-05-18T00:56:44.553372Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:44.553372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gf8ZKHW35oZPkTMMGwqQP6BNi6SFO9sC0MDd+UXSfVK8ySwSouMH3BETVIJ/HYYlRLC6Eozvtj8O+a8r6EsEAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:44.554256Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.08060","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:39e9df715f71dbe69ce246845c6e0335a4699c7da9b39a431947967ef1784250","sha256:aaa697633e7ca12753bfa9284a1b9a788aabf2d9a57117d18a3fea3e88771d81"],"state_sha256":"feb73c24924ebd2150d9358327243277dd877baf4ec7e2a71b9561550b77632b"}