{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:AWRJLCF3LM3LMBZKIQTLWEHZBZ","short_pith_number":"pith:AWRJLCF3","schema_version":"1.0","canonical_sha256":"05a29588bb5b36b6072a4426bb10f90e59262c46efccb4140e9f154adccc9d73","source":{"kind":"arxiv","id":"2509.09641","version":1},"attestation_state":"computed","paper":{"title":"Maximizing social welfare among EF1 allocations at the presence of two types of agents","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"An Zhang, Guangting Chen, Guohui Lin, Jiaxuan Ma, Mingyang Gong, Yong Chen","submitted_at":"2025-09-11T17:28:01Z","abstract_excerpt":"We study the fair allocation of indivisible items to $n$ agents to maximize the utilitarian social welfare, where the fairness criterion is envy-free up to one item and there are only two different utility functions shared by the agents. We present a $2$-approximation algorithm when the two utility functions are normalized, improving the previous best ratio of $16 \\sqrt{n}$ shown for general normalized utility functions; thus this constant ratio approximation algorithm confirms the APX-completeness in this special case previously shown APX-hard. When there are only three agents, i.e., $n = 3$,"},"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":"2509.09641","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-09-11T17:28:01Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"6597209f4a9a8fe0b1df9392b09ae3437860b52ccca5ff52f2ed535b4161c7ea","abstract_canon_sha256":"d4f55336f1c16700594a2f8a279b129d03d3cb5b4df1c73921342ed705919db3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:09:40.068680Z","signature_b64":"bstfxfkzXIAe14bnVMaummHxA80hZQVA7FCYhSkdETpqybSnQhzb6MuoPqVK8Wb+xSfLukhE5tL14maC1H9jAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05a29588bb5b36b6072a4426bb10f90e59262c46efccb4140e9f154adccc9d73","last_reissued_at":"2026-07-05T12:09:40.068130Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:09:40.068130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximizing social welfare among EF1 allocations at the presence of two types of agents","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"An Zhang, Guangting Chen, Guohui Lin, Jiaxuan Ma, Mingyang Gong, Yong Chen","submitted_at":"2025-09-11T17:28:01Z","abstract_excerpt":"We study the fair allocation of indivisible items to $n$ agents to maximize the utilitarian social welfare, where the fairness criterion is envy-free up to one item and there are only two different utility functions shared by the agents. We present a $2$-approximation algorithm when the two utility functions are normalized, improving the previous best ratio of $16 \\sqrt{n}$ shown for general normalized utility functions; thus this constant ratio approximation algorithm confirms the APX-completeness in this special case previously shown APX-hard. When there are only three agents, i.e., $n = 3$,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.09641","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2509.09641/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2509.09641","created_at":"2026-07-05T12:09:40.068193+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.09641v1","created_at":"2026-07-05T12:09:40.068193+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.09641","created_at":"2026-07-05T12:09:40.068193+00:00"},{"alias_kind":"pith_short_12","alias_value":"AWRJLCF3LM3L","created_at":"2026-07-05T12:09:40.068193+00:00"},{"alias_kind":"pith_short_16","alias_value":"AWRJLCF3LM3LMBZK","created_at":"2026-07-05T12:09:40.068193+00:00"},{"alias_kind":"pith_short_8","alias_value":"AWRJLCF3","created_at":"2026-07-05T12:09:40.068193+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/AWRJLCF3LM3LMBZKIQTLWEHZBZ","json":"https://pith.science/pith/AWRJLCF3LM3LMBZKIQTLWEHZBZ.json","graph_json":"https://pith.science/api/pith-number/AWRJLCF3LM3LMBZKIQTLWEHZBZ/graph.json","events_json":"https://pith.science/api/pith-number/AWRJLCF3LM3LMBZKIQTLWEHZBZ/events.json","paper":"https://pith.science/paper/AWRJLCF3"},"agent_actions":{"view_html":"https://pith.science/pith/AWRJLCF3LM3LMBZKIQTLWEHZBZ","download_json":"https://pith.science/pith/AWRJLCF3LM3LMBZKIQTLWEHZBZ.json","view_paper":"https://pith.science/paper/AWRJLCF3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.09641&json=true","fetch_graph":"https://pith.science/api/pith-number/AWRJLCF3LM3LMBZKIQTLWEHZBZ/graph.json","fetch_events":"https://pith.science/api/pith-number/AWRJLCF3LM3LMBZKIQTLWEHZBZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AWRJLCF3LM3LMBZKIQTLWEHZBZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AWRJLCF3LM3LMBZKIQTLWEHZBZ/action/storage_attestation","attest_author":"https://pith.science/pith/AWRJLCF3LM3LMBZKIQTLWEHZBZ/action/author_attestation","sign_citation":"https://pith.science/pith/AWRJLCF3LM3LMBZKIQTLWEHZBZ/action/citation_signature","submit_replication":"https://pith.science/pith/AWRJLCF3LM3LMBZKIQTLWEHZBZ/action/replication_record"}},"created_at":"2026-07-05T12:09:40.068193+00:00","updated_at":"2026-07-05T12:09:40.068193+00:00"}