{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:IJHT5WF4BNCVXFDZ2ASG7XXDFN","short_pith_number":"pith:IJHT5WF4","schema_version":"1.0","canonical_sha256":"424f3ed8bc0b455b9479d0246fdee32b4d73347a850211fec60038516ec798eb","source":{"kind":"arxiv","id":"2410.12966","version":1},"attestation_state":"computed","paper":{"title":"EF1 for Mixed Manna with Unequal Entitlements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Eklavya Sharma, Jugal Garg","submitted_at":"2024-10-16T18:58:28Z","abstract_excerpt":"We study fair division of indivisible mixed manna when agents have unequal entitlements, with weighted envy-freeness up to one item (WEF1) as our primary notion of fairness. We identify several shortcomings of existing techniques to achieve WEF1. Hence, we relax WEF1 to weighted envy-freeness up to 1 transfer (WEF1T), and give a polynomial-time algorithm for achieving it. We also generalize Fisher markets to the mixed manna setting, and use them to get a polynomial-time algorithm for two agents that outputs a WEF1 allocation."},"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":"2410.12966","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2024-10-16T18:58:28Z","cross_cats_sorted":[],"title_canon_sha256":"df230b417c176c859637c870fecacdae991b77d1139cc817c78d06998895a2fe","abstract_canon_sha256":"ec870908c890da1decff26690fb09b4ef7aae852edc822067d8acee913faf5e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:21:53.427675Z","signature_b64":"oepm8mDWjeJsO7aJKrKW3BlcawHq40DZwryx1EIkXIN/qbvHeKFZiDqklvdJ8v56sQhJDDB33I+BIkM7N4CjDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"424f3ed8bc0b455b9479d0246fdee32b4d73347a850211fec60038516ec798eb","last_reissued_at":"2026-07-05T09:21:53.427290Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:21:53.427290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"EF1 for Mixed Manna with Unequal Entitlements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Eklavya Sharma, Jugal Garg","submitted_at":"2024-10-16T18:58:28Z","abstract_excerpt":"We study fair division of indivisible mixed manna when agents have unequal entitlements, with weighted envy-freeness up to one item (WEF1) as our primary notion of fairness. We identify several shortcomings of existing techniques to achieve WEF1. Hence, we relax WEF1 to weighted envy-freeness up to 1 transfer (WEF1T), and give a polynomial-time algorithm for achieving it. We also generalize Fisher markets to the mixed manna setting, and use them to get a polynomial-time algorithm for two agents that outputs a WEF1 allocation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.12966","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/2410.12966/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":"2410.12966","created_at":"2026-07-05T09:21:53.427353+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.12966v1","created_at":"2026-07-05T09:21:53.427353+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.12966","created_at":"2026-07-05T09:21:53.427353+00:00"},{"alias_kind":"pith_short_12","alias_value":"IJHT5WF4BNCV","created_at":"2026-07-05T09:21:53.427353+00:00"},{"alias_kind":"pith_short_16","alias_value":"IJHT5WF4BNCVXFDZ","created_at":"2026-07-05T09:21:53.427353+00:00"},{"alias_kind":"pith_short_8","alias_value":"IJHT5WF4","created_at":"2026-07-05T09:21:53.427353+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.02815","citing_title":"Exploring Relations among Fairness Notions in Discrete Fair Division","ref_index":41,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IJHT5WF4BNCVXFDZ2ASG7XXDFN","json":"https://pith.science/pith/IJHT5WF4BNCVXFDZ2ASG7XXDFN.json","graph_json":"https://pith.science/api/pith-number/IJHT5WF4BNCVXFDZ2ASG7XXDFN/graph.json","events_json":"https://pith.science/api/pith-number/IJHT5WF4BNCVXFDZ2ASG7XXDFN/events.json","paper":"https://pith.science/paper/IJHT5WF4"},"agent_actions":{"view_html":"https://pith.science/pith/IJHT5WF4BNCVXFDZ2ASG7XXDFN","download_json":"https://pith.science/pith/IJHT5WF4BNCVXFDZ2ASG7XXDFN.json","view_paper":"https://pith.science/paper/IJHT5WF4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.12966&json=true","fetch_graph":"https://pith.science/api/pith-number/IJHT5WF4BNCVXFDZ2ASG7XXDFN/graph.json","fetch_events":"https://pith.science/api/pith-number/IJHT5WF4BNCVXFDZ2ASG7XXDFN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IJHT5WF4BNCVXFDZ2ASG7XXDFN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IJHT5WF4BNCVXFDZ2ASG7XXDFN/action/storage_attestation","attest_author":"https://pith.science/pith/IJHT5WF4BNCVXFDZ2ASG7XXDFN/action/author_attestation","sign_citation":"https://pith.science/pith/IJHT5WF4BNCVXFDZ2ASG7XXDFN/action/citation_signature","submit_replication":"https://pith.science/pith/IJHT5WF4BNCVXFDZ2ASG7XXDFN/action/replication_record"}},"created_at":"2026-07-05T09:21:53.427353+00:00","updated_at":"2026-07-05T09:21:53.427353+00:00"}