{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:YHQP46OPXV2K4JIX52HU56SSVD","short_pith_number":"pith:YHQP46OP","schema_version":"1.0","canonical_sha256":"c1e0fe79cfbd74ae2517ee8f4efa52a8c2bb994530d1a2226fc5ffba2c9ffc87","source":{"kind":"arxiv","id":"2508.14522","version":4},"attestation_state":"computed","paper":{"title":"Equal Treatment of Equals and Efficiency in Probabilistic Assignments","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"Equal treatment of equals can be achieved together with ordinal efficiency in probabilistic assignments of indivisible objects.","cross_cats":[],"primary_cat":"econ.TH","authors_text":"Yasunori Okumura","submitted_at":"2025-08-20T08:31:22Z","abstract_excerpt":"This paper studies general multi-unit probabilistic assignment problems involving indivisible objects, with a particular focus on achieving the fairness notion of equal treatment of equals (ETE) and satisfying various efficiency criteria. We extend the definition of ETE so that it accommodates a wide range of constraints and applications. We introduce the ETE reassignment procedure, which transforms any assignment into one that satisfies ETE, and examine whether the efficiency properties satisfied by the original assignment -- namely, ex-post efficiency, ordinal efficiency, and rank-minimizing"},"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":true},"canonical_record":{"source":{"id":"2508.14522","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"econ.TH","submitted_at":"2025-08-20T08:31:22Z","cross_cats_sorted":[],"title_canon_sha256":"ecb0824743f810fb6a07052a94bcd84c9d20429a22b60bbc1f93bed58a606725","abstract_canon_sha256":"306d84bdb0cf7506362a51bdb2ede45a6ae2b33de24eac7982758d52107b3a11"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:22.753577Z","signature_b64":"rAOujLFItzpaNxaqDmSiXaZFM39YAh9ELTDq2RAiouuI92gzio+s9fUMkr4W8waQFiBZwNa4/LwnRGDbGB/iBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1e0fe79cfbd74ae2517ee8f4efa52a8c2bb994530d1a2226fc5ffba2c9ffc87","last_reissued_at":"2026-05-20T00:00:22.752748Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:22.752748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Equal Treatment of Equals and Efficiency in Probabilistic Assignments","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"Equal treatment of equals can be achieved together with ordinal efficiency in probabilistic assignments of indivisible objects.","cross_cats":[],"primary_cat":"econ.TH","authors_text":"Yasunori Okumura","submitted_at":"2025-08-20T08:31:22Z","abstract_excerpt":"This paper studies general multi-unit probabilistic assignment problems involving indivisible objects, with a particular focus on achieving the fairness notion of equal treatment of equals (ETE) and satisfying various efficiency criteria. We extend the definition of ETE so that it accommodates a wide range of constraints and applications. We introduce the ETE reassignment procedure, which transforms any assignment into one that satisfies ETE, and examine whether the efficiency properties satisfied by the original assignment -- namely, ex-post efficiency, ordinal efficiency, and rank-minimizing"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Since the ETE reassignment of a rank-minimizing assignment preserves rank-minimizing efficiency, there must exist an assignment satisfying both ETE and ordinal efficiency. Furthermore, we propose a computationally efficient method for constructing assignments that satisfy both ETE and ordinal efficiency under general upper bound constraints by combining the serial dictatorship rule with appropriately specified priority lists and the ETE reassignment procedure.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The ETE reassignment of a rank-minimizing assignment preserves rank-minimizing efficiency (abstract, paragraph on preservation results). If this preservation fails under the extended ETE definition or general constraints, the existence claim for joint ETE and ordinal efficiency would not follow.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Extends equal treatment of equals to general multi-unit probabilistic assignments, introduces ETE reassignment that preserves ex-post and rank-minimizing efficiency, and provides a method to achieve both ETE and ordinal efficiency using serial dictatorship.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Equal treatment of equals can be achieved together with ordinal efficiency in probabilistic assignments of indivisible objects.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"27e2c0aef1068095bf395f421d81512e084e74e90ff1d892c1d7ba0627c5fb32"},"source":{"id":"2508.14522","kind":"arxiv","version":4},"verdict":{"id":"5349dc78-92e8-413a-ab30-38f5335d1af2","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-18T22:34:40.956131Z","strongest_claim":"Since the ETE reassignment of a rank-minimizing assignment preserves rank-minimizing efficiency, there must exist an assignment satisfying both ETE and ordinal efficiency. Furthermore, we propose a computationally efficient method for constructing assignments that satisfy both ETE and ordinal efficiency under general upper bound constraints by combining the serial dictatorship rule with appropriately specified priority lists and the ETE reassignment procedure.","one_line_summary":"Extends equal treatment of equals to general multi-unit probabilistic assignments, introduces ETE reassignment that preserves ex-post and rank-minimizing efficiency, and provides a method to achieve both ETE and ordinal efficiency using serial dictatorship.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The ETE reassignment of a rank-minimizing assignment preserves rank-minimizing efficiency (abstract, paragraph on preservation results). If this preservation fails under the extended ETE definition or general constraints, the existence claim for joint ETE and ordinal efficiency would not follow.","pith_extraction_headline":"Equal treatment of equals can be achieved together with ordinal efficiency in probabilistic assignments of indivisible objects."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.14522/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":1,"snapshot_sha256":"d150c05f5a85873596524823edf305a53cf25c923fc32e94285cd24b60029d9d"},"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":"2508.14522","created_at":"2026-05-20T00:00:22.752880+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.14522v4","created_at":"2026-05-20T00:00:22.752880+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.14522","created_at":"2026-05-20T00:00:22.752880+00:00"},{"alias_kind":"pith_short_12","alias_value":"YHQP46OPXV2K","created_at":"2026-05-20T00:00:22.752880+00:00"},{"alias_kind":"pith_short_16","alias_value":"YHQP46OPXV2K4JIX","created_at":"2026-05-20T00:00:22.752880+00:00"},{"alias_kind":"pith_short_8","alias_value":"YHQP46OP","created_at":"2026-05-20T00:00:22.752880+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.06721","citing_title":"A Simple Method for School Choice Lotteries","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":1,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YHQP46OPXV2K4JIX52HU56SSVD","json":"https://pith.science/pith/YHQP46OPXV2K4JIX52HU56SSVD.json","graph_json":"https://pith.science/api/pith-number/YHQP46OPXV2K4JIX52HU56SSVD/graph.json","events_json":"https://pith.science/api/pith-number/YHQP46OPXV2K4JIX52HU56SSVD/events.json","paper":"https://pith.science/paper/YHQP46OP"},"agent_actions":{"view_html":"https://pith.science/pith/YHQP46OPXV2K4JIX52HU56SSVD","download_json":"https://pith.science/pith/YHQP46OPXV2K4JIX52HU56SSVD.json","view_paper":"https://pith.science/paper/YHQP46OP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.14522&json=true","fetch_graph":"https://pith.science/api/pith-number/YHQP46OPXV2K4JIX52HU56SSVD/graph.json","fetch_events":"https://pith.science/api/pith-number/YHQP46OPXV2K4JIX52HU56SSVD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YHQP46OPXV2K4JIX52HU56SSVD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YHQP46OPXV2K4JIX52HU56SSVD/action/storage_attestation","attest_author":"https://pith.science/pith/YHQP46OPXV2K4JIX52HU56SSVD/action/author_attestation","sign_citation":"https://pith.science/pith/YHQP46OPXV2K4JIX52HU56SSVD/action/citation_signature","submit_replication":"https://pith.science/pith/YHQP46OPXV2K4JIX52HU56SSVD/action/replication_record"}},"created_at":"2026-05-20T00:00:22.752880+00:00","updated_at":"2026-05-20T00:00:22.752880+00:00"}