{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:WGPBYCFQCQSACYI77NOO52C4D6","short_pith_number":"pith:WGPBYCFQ","schema_version":"1.0","canonical_sha256":"b19e1c08b0142401611ffb5ceee85c1f900eb183b1cb96250d70dd2398eec123","source":{"kind":"arxiv","id":"1610.00082","version":2},"attestation_state":"computed","paper":{"title":"PTAS for Ordered Instances of Resource Allocation Problems with Restrictions on Inclusions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Arash Rafiey, Georgios Stamoulis, Kamyar Khodamoradi, Ramesh Krishnamurti","submitted_at":"2016-10-01T03:58:58Z","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"},"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":"1610.00082","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-01T03:58:58Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"bcaf0de3cf348dce9c005bf782164a1e922644db38540b8817842e27a79995f4","abstract_canon_sha256":"936b33c9a86928ecc377e0945d8981a7123eb9558d67ccadd246416f214abd76"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:49.709761Z","signature_b64":"ubpiVh78MZ1S+AMukqaLYx0C7UroNR3+5F8vBN47/ppjdb5Z+baGV9ylgLkZsj0Ocug2jo4wX1uYqTr5MrCnBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b19e1c08b0142401611ffb5ceee85c1f900eb183b1cb96250d70dd2398eec123","last_reissued_at":"2026-05-18T01:02:49.709156Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:49.709156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PTAS for Ordered Instances of Resource Allocation Problems with Restrictions on Inclusions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Arash Rafiey, Georgios Stamoulis, Kamyar Khodamoradi, Ramesh Krishnamurti","submitted_at":"2016-10-01T03:58:58Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00082","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":"1610.00082","created_at":"2026-05-18T01:02:49.709248+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.00082v2","created_at":"2026-05-18T01:02:49.709248+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00082","created_at":"2026-05-18T01:02:49.709248+00:00"},{"alias_kind":"pith_short_12","alias_value":"WGPBYCFQCQSA","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"WGPBYCFQCQSACYI7","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"WGPBYCFQ","created_at":"2026-05-18T12:30:48.956258+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"1907.03526","citing_title":"Inapproximability Results for Scheduling with Interval and Resource Restrictions","ref_index":22,"is_internal_anchor":true},{"citing_arxiv_id":"1907.03526","citing_title":"Inapproximability Results for Scheduling with Interval and Resource Restrictions","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WGPBYCFQCQSACYI77NOO52C4D6","json":"https://pith.science/pith/WGPBYCFQCQSACYI77NOO52C4D6.json","graph_json":"https://pith.science/api/pith-number/WGPBYCFQCQSACYI77NOO52C4D6/graph.json","events_json":"https://pith.science/api/pith-number/WGPBYCFQCQSACYI77NOO52C4D6/events.json","paper":"https://pith.science/paper/WGPBYCFQ"},"agent_actions":{"view_html":"https://pith.science/pith/WGPBYCFQCQSACYI77NOO52C4D6","download_json":"https://pith.science/pith/WGPBYCFQCQSACYI77NOO52C4D6.json","view_paper":"https://pith.science/paper/WGPBYCFQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.00082&json=true","fetch_graph":"https://pith.science/api/pith-number/WGPBYCFQCQSACYI77NOO52C4D6/graph.json","fetch_events":"https://pith.science/api/pith-number/WGPBYCFQCQSACYI77NOO52C4D6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WGPBYCFQCQSACYI77NOO52C4D6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WGPBYCFQCQSACYI77NOO52C4D6/action/storage_attestation","attest_author":"https://pith.science/pith/WGPBYCFQCQSACYI77NOO52C4D6/action/author_attestation","sign_citation":"https://pith.science/pith/WGPBYCFQCQSACYI77NOO52C4D6/action/citation_signature","submit_replication":"https://pith.science/pith/WGPBYCFQCQSACYI77NOO52C4D6/action/replication_record"}},"created_at":"2026-05-18T01:02:49.709248+00:00","updated_at":"2026-05-18T01:02:49.709248+00:00"}