{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:XFFQJVCSUZHHLGAC446VTPPQVY","short_pith_number":"pith:XFFQJVCS","schema_version":"1.0","canonical_sha256":"b94b04d452a64e759802e73d59bdf0ae086afb621297cfd3f76c8bcc28abf3f5","source":{"kind":"arxiv","id":"2211.16143","version":1},"attestation_state":"computed","paper":{"title":"Fair Division with Prioritized Agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Biaoshuai Tao, Jiaxin Song, Shengxin Liu, Xiaolin Bu, Zihao Li","submitted_at":"2022-11-29T12:16:56Z","abstract_excerpt":"We consider the fair division problem of indivisible items. It is well-known that an envy-free allocation may not exist, and a relaxed version of envy-freeness, envy-freeness up to one item (EF1), has been widely considered. In an EF1 allocation, an agent may envy others' allocated shares, but only up to one item. In many applications, we may wish to specify a subset of prioritized agents where strict envy-freeness needs to be guaranteed from these agents to the remaining agents, while ensuring the whole allocation is still EF1. Prioritized agents may be those agents who are envious in a previ"},"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":"2211.16143","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2022-11-29T12:16:56Z","cross_cats_sorted":[],"title_canon_sha256":"0a2d0f47f7601e71d681fe6d154ad67e27b95a5e6f0a8848ad9281b01436c966","abstract_canon_sha256":"1575d88e548f8536a225304041c3f10676a04d76b889b8cba5478fe238bfe22b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:20:23.821963Z","signature_b64":"MBQBBaaSf8rCJtTlkM8y40ljDff4+otyAu1loGCoyVdeMykzykvIfXSMQBvkpuYeYNyW93eT+epsgJRe6UqnAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b94b04d452a64e759802e73d59bdf0ae086afb621297cfd3f76c8bcc28abf3f5","last_reissued_at":"2026-07-05T05:20:23.821565Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:20:23.821565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fair Division with Prioritized Agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Biaoshuai Tao, Jiaxin Song, Shengxin Liu, Xiaolin Bu, Zihao Li","submitted_at":"2022-11-29T12:16:56Z","abstract_excerpt":"We consider the fair division problem of indivisible items. It is well-known that an envy-free allocation may not exist, and a relaxed version of envy-freeness, envy-freeness up to one item (EF1), has been widely considered. In an EF1 allocation, an agent may envy others' allocated shares, but only up to one item. In many applications, we may wish to specify a subset of prioritized agents where strict envy-freeness needs to be guaranteed from these agents to the remaining agents, while ensuring the whole allocation is still EF1. Prioritized agents may be those agents who are envious in a previ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.16143","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/2211.16143/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":"2211.16143","created_at":"2026-07-05T05:20:23.821622+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.16143v1","created_at":"2026-07-05T05:20:23.821622+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.16143","created_at":"2026-07-05T05:20:23.821622+00:00"},{"alias_kind":"pith_short_12","alias_value":"XFFQJVCSUZHH","created_at":"2026-07-05T05:20:23.821622+00:00"},{"alias_kind":"pith_short_16","alias_value":"XFFQJVCSUZHHLGAC","created_at":"2026-07-05T05:20:23.821622+00:00"},{"alias_kind":"pith_short_8","alias_value":"XFFQJVCS","created_at":"2026-07-05T05:20:23.821622+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/XFFQJVCSUZHHLGAC446VTPPQVY","json":"https://pith.science/pith/XFFQJVCSUZHHLGAC446VTPPQVY.json","graph_json":"https://pith.science/api/pith-number/XFFQJVCSUZHHLGAC446VTPPQVY/graph.json","events_json":"https://pith.science/api/pith-number/XFFQJVCSUZHHLGAC446VTPPQVY/events.json","paper":"https://pith.science/paper/XFFQJVCS"},"agent_actions":{"view_html":"https://pith.science/pith/XFFQJVCSUZHHLGAC446VTPPQVY","download_json":"https://pith.science/pith/XFFQJVCSUZHHLGAC446VTPPQVY.json","view_paper":"https://pith.science/paper/XFFQJVCS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.16143&json=true","fetch_graph":"https://pith.science/api/pith-number/XFFQJVCSUZHHLGAC446VTPPQVY/graph.json","fetch_events":"https://pith.science/api/pith-number/XFFQJVCSUZHHLGAC446VTPPQVY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XFFQJVCSUZHHLGAC446VTPPQVY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XFFQJVCSUZHHLGAC446VTPPQVY/action/storage_attestation","attest_author":"https://pith.science/pith/XFFQJVCSUZHHLGAC446VTPPQVY/action/author_attestation","sign_citation":"https://pith.science/pith/XFFQJVCSUZHHLGAC446VTPPQVY/action/citation_signature","submit_replication":"https://pith.science/pith/XFFQJVCSUZHHLGAC446VTPPQVY/action/replication_record"}},"created_at":"2026-07-05T05:20:23.821622+00:00","updated_at":"2026-07-05T05:20:23.821622+00:00"}