{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:F3Q3K767OKM73EVISMYRISCYVF","short_pith_number":"pith:F3Q3K767","schema_version":"1.0","canonical_sha256":"2ee1b57fdf7299fd92a89331144858a95f7829c6dd0970350b749e70e1042aea","source":{"kind":"arxiv","id":"2604.25308","version":2},"attestation_state":"computed","paper":{"title":"Computing welfare and fairness in allocating identical goods with entitlements and general utility functions","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"A polynomial-time algorithm computes the maximum weighted Rawlsian and Leximin welfare for identical goods under arbitrary increasing agent utilities.","cross_cats":[],"primary_cat":"math.OC","authors_text":"Manouchehr Zaker","submitted_at":"2026-04-28T07:17:07Z","abstract_excerpt":"A number of goods are called identical if they provide the same level of utility to each agent. In various real-world instances of fair division scenarios, identical indivisible items are allocated to consumers and demandants with different entitlements. We assume that the utility of $t$ identical items to each agent $A$ equals $f_A(t)$, where $f_A$ is an arbitrary increasing function corresponding to $A$. We present a polynomial time algorithm that determines the maximum weighted Rawlsian and Leximin welfare for scenarios with identical goods and show that the allocation obtained by the algor"},"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":"2604.25308","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2026-04-28T07:17:07Z","cross_cats_sorted":[],"title_canon_sha256":"3448dc7a93ff6f1d044e2268ebc05c7f56a4172f1b676f013cdedb21eeb69f42","abstract_canon_sha256":"0eb3d7ca08b175fa114f82e943b956ec23f6237d0d084e8498ae1fc8266cd231"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T01:04:40.889356Z","signature_b64":"LDK3nAljuzF+A0g7eoGfnpMx2Ywm8/T3cFRg8Dfy6d0AsOV3YeqXGYLYmcKrnplaf8jA5MFehJsj+PazKmtsCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ee1b57fdf7299fd92a89331144858a95f7829c6dd0970350b749e70e1042aea","last_reissued_at":"2026-05-28T01:04:40.888817Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T01:04:40.888817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing welfare and fairness in allocating identical goods with entitlements and general utility functions","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"A polynomial-time algorithm computes the maximum weighted Rawlsian and Leximin welfare for identical goods under arbitrary increasing agent utilities.","cross_cats":[],"primary_cat":"math.OC","authors_text":"Manouchehr Zaker","submitted_at":"2026-04-28T07:17:07Z","abstract_excerpt":"A number of goods are called identical if they provide the same level of utility to each agent. In various real-world instances of fair division scenarios, identical indivisible items are allocated to consumers and demandants with different entitlements. We assume that the utility of $t$ identical items to each agent $A$ equals $f_A(t)$, where $f_A$ is an arbitrary increasing function corresponding to $A$. We present a polynomial time algorithm that determines the maximum weighted Rawlsian and Leximin welfare for scenarios with identical goods and show that the allocation obtained by the algor"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We present a polynomial time algorithm that determines the maximum weighted Rawlsian and Leximin welfare for scenarios with identical goods and show that the allocation obtained by the algorithm is equitable up to any item (WEQX).","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"We assume that the utility of t identical items to each agent A equals f_A(t), where f_A is an arbitrary increasing function associated with A.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A polynomial-time algorithm computes maximum weighted Rawlsian and Leximin welfare for identical goods and uses total weighted deficit to achieve equitable allocations with minimal compensation.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A polynomial-time algorithm computes the maximum weighted Rawlsian and Leximin welfare for identical goods under arbitrary increasing agent utilities.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"fa6244676616d34f1baf79aa8427e81138ef97d278cf0286208a4c43f7e7f160"},"source":{"id":"2604.25308","kind":"arxiv","version":2},"verdict":{"id":"26bc3a28-59c7-4420-9c47-901f8af2ea9d","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-07T15:45:41.842179Z","strongest_claim":"We present a polynomial time algorithm that determines the maximum weighted Rawlsian and Leximin welfare for scenarios with identical goods and show that the allocation obtained by the algorithm is equitable up to any item (WEQX).","one_line_summary":"A polynomial-time algorithm computes maximum weighted Rawlsian and Leximin welfare for identical goods and uses total weighted deficit to achieve equitable allocations with minimal compensation.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"We assume that the utility of t identical items to each agent A equals f_A(t), where f_A is an arbitrary increasing function associated with A.","pith_extraction_headline":"A polynomial-time algorithm computes the maximum weighted Rawlsian and Leximin welfare for identical goods under arbitrary increasing agent utilities."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.25308/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-21T05:33:46.081300Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T21:13:45.850697Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"3bba0029f697fc2951f8d52352cbc00128f1e4820fb62be617b5128a9bdc3bd7"},"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":"2604.25308","created_at":"2026-05-28T01:04:40.888891+00:00"},{"alias_kind":"arxiv_version","alias_value":"2604.25308v2","created_at":"2026-05-28T01:04:40.888891+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.25308","created_at":"2026-05-28T01:04:40.888891+00:00"},{"alias_kind":"pith_short_12","alias_value":"F3Q3K767OKM7","created_at":"2026-05-28T01:04:40.888891+00:00"},{"alias_kind":"pith_short_16","alias_value":"F3Q3K767OKM73EVI","created_at":"2026-05-28T01:04:40.888891+00:00"},{"alias_kind":"pith_short_8","alias_value":"F3Q3K767","created_at":"2026-05-28T01:04:40.888891+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/F3Q3K767OKM73EVISMYRISCYVF","json":"https://pith.science/pith/F3Q3K767OKM73EVISMYRISCYVF.json","graph_json":"https://pith.science/api/pith-number/F3Q3K767OKM73EVISMYRISCYVF/graph.json","events_json":"https://pith.science/api/pith-number/F3Q3K767OKM73EVISMYRISCYVF/events.json","paper":"https://pith.science/paper/F3Q3K767"},"agent_actions":{"view_html":"https://pith.science/pith/F3Q3K767OKM73EVISMYRISCYVF","download_json":"https://pith.science/pith/F3Q3K767OKM73EVISMYRISCYVF.json","view_paper":"https://pith.science/paper/F3Q3K767","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2604.25308&json=true","fetch_graph":"https://pith.science/api/pith-number/F3Q3K767OKM73EVISMYRISCYVF/graph.json","fetch_events":"https://pith.science/api/pith-number/F3Q3K767OKM73EVISMYRISCYVF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F3Q3K767OKM73EVISMYRISCYVF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F3Q3K767OKM73EVISMYRISCYVF/action/storage_attestation","attest_author":"https://pith.science/pith/F3Q3K767OKM73EVISMYRISCYVF/action/author_attestation","sign_citation":"https://pith.science/pith/F3Q3K767OKM73EVISMYRISCYVF/action/citation_signature","submit_replication":"https://pith.science/pith/F3Q3K767OKM73EVISMYRISCYVF/action/replication_record"}},"created_at":"2026-05-28T01:04:40.888891+00:00","updated_at":"2026-05-28T01:04:40.888891+00:00"}