{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:WGPBYCFQCQSACYI77NOO52C4D6","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":"936b33c9a86928ecc377e0945d8981a7123eb9558d67ccadd246416f214abd76","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-01T03:58:58Z","title_canon_sha256":"bcaf0de3cf348dce9c005bf782164a1e922644db38540b8817842e27a79995f4"},"schema_version":"1.0","source":{"id":"1610.00082","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.00082","created_at":"2026-05-18T01:02:49Z"},{"alias_kind":"arxiv_version","alias_value":"1610.00082v2","created_at":"2026-05-18T01:02:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00082","created_at":"2026-05-18T01:02:49Z"},{"alias_kind":"pith_short_12","alias_value":"WGPBYCFQCQSA","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"WGPBYCFQCQSACYI7","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"WGPBYCFQ","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:fd511cf19e4bf5c9c65a40f27152b21efb82ba69618032d7107a02ea8325af9d","target":"graph","created_at":"2026-05-18T01:02:49Z","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 consider the problem of allocating a set $I$ of $m$ indivisible resources (items) to a set $P$ of $n$ customers (players) competing for the resources. Each resource $j \\in I$ has a same value $v_j > 0$ for a subset of customers interested in $j$, and zero value for the remaining customers. The utility received by each customer is the sum of the values of the resources allocated to her. The goal is to find a feasible allocation of the resources to the interested customers such that for the Max-Min allocation problem (Min-Max allocation problem) the minimum of the utilities (maximum of the ut","authors_text":"Arash Rafiey, Georgios Stamoulis, Kamyar Khodamoradi, Ramesh Krishnamurti","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-01T03:58:58Z","title":"PTAS for Ordered Instances of Resource Allocation Problems with Restrictions on Inclusions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00082","kind":"arxiv","version":2},"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:5453f1cafe13ce0fdf9db017be3b1b8182857a22b8076ab0eb150c5ade9e220c","target":"record","created_at":"2026-05-18T01:02:49Z","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":"936b33c9a86928ecc377e0945d8981a7123eb9558d67ccadd246416f214abd76","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-01T03:58:58Z","title_canon_sha256":"bcaf0de3cf348dce9c005bf782164a1e922644db38540b8817842e27a79995f4"},"schema_version":"1.0","source":{"id":"1610.00082","kind":"arxiv","version":2}},"canonical_sha256":"b19e1c08b0142401611ffb5ceee85c1f900eb183b1cb96250d70dd2398eec123","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b19e1c08b0142401611ffb5ceee85c1f900eb183b1cb96250d70dd2398eec123","first_computed_at":"2026-05-18T01:02:49.709156Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:49.709156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ubpiVh78MZ1S+AMukqaLYx0C7UroNR3+5F8vBN47/ppjdb5Z+baGV9ylgLkZsj0Ocug2jo4wX1uYqTr5MrCnBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:49.709761Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.00082","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5453f1cafe13ce0fdf9db017be3b1b8182857a22b8076ab0eb150c5ade9e220c","sha256:fd511cf19e4bf5c9c65a40f27152b21efb82ba69618032d7107a02ea8325af9d"],"state_sha256":"48dae162608a2e5162e0d42eb1df18ee2c72cefb227d61b8fff436522c73fe5d"}