{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WKVMSLH62WPLO5P3R5ZWACEWZI","short_pith_number":"pith:WKVMSLH6","schema_version":"1.0","canonical_sha256":"b2aac92cfed59eb775fb8f73600896ca1f7309298113c5706d3d2e26bed539c4","source":{"kind":"arxiv","id":"1810.04331","version":2},"attestation_state":"computed","paper":{"title":"Assignment Mechanisms under Distributional Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Ali Shameli, Amin Saberi, Itai Ashlagi","submitted_at":"2018-10-10T02:20:02Z","abstract_excerpt":"We study the assignment problem of objects to agents with heterogeneous preferences under distributional constraints. Each agent is associated with a publicly known type and has a private ordinal ranking over objects. We are interested in assigning as many agents as possible. Our first contribution is a generalization of the well-known and widely used serial dictatorship. Our mechanism maintains several desirable properties of serial dictatorship, including strategyproofness, Pareto efficiency, and computational tractability while satisfying the distributional constraints with a small error. W"},"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":"1810.04331","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-10T02:20:02Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"ea6f3e18351dd0755f1b0c02503da55a65a0e6b658b61e83d24f77e546fcee8c","abstract_canon_sha256":"d02c6413586ab2f57bb8a714f239e4f81c10222e36d766e19e3bdf0220c82147"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:15.912238Z","signature_b64":"LQ1XPmyXe7CPOOQST9I3mloPL5Sqi54L/GcMaYW5f/bz9V4NoB0Uj98ZtohoIcsa1OQEoc83NWrMvNPyFuC+Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2aac92cfed59eb775fb8f73600896ca1f7309298113c5706d3d2e26bed539c4","last_reissued_at":"2026-05-17T23:47:15.911821Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:15.911821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Assignment Mechanisms under Distributional Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Ali Shameli, Amin Saberi, Itai Ashlagi","submitted_at":"2018-10-10T02:20:02Z","abstract_excerpt":"We study the assignment problem of objects to agents with heterogeneous preferences under distributional constraints. Each agent is associated with a publicly known type and has a private ordinal ranking over objects. We are interested in assigning as many agents as possible. Our first contribution is a generalization of the well-known and widely used serial dictatorship. Our mechanism maintains several desirable properties of serial dictatorship, including strategyproofness, Pareto efficiency, and computational tractability while satisfying the distributional constraints with a small error. W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04331","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1810.04331","created_at":"2026-05-17T23:47:15.911883+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.04331v2","created_at":"2026-05-17T23:47:15.911883+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04331","created_at":"2026-05-17T23:47:15.911883+00:00"},{"alias_kind":"pith_short_12","alias_value":"WKVMSLH62WPL","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"WKVMSLH62WPLO5P3","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"WKVMSLH6","created_at":"2026-05-18T12:33:01.666342+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/WKVMSLH62WPLO5P3R5ZWACEWZI","json":"https://pith.science/pith/WKVMSLH62WPLO5P3R5ZWACEWZI.json","graph_json":"https://pith.science/api/pith-number/WKVMSLH62WPLO5P3R5ZWACEWZI/graph.json","events_json":"https://pith.science/api/pith-number/WKVMSLH62WPLO5P3R5ZWACEWZI/events.json","paper":"https://pith.science/paper/WKVMSLH6"},"agent_actions":{"view_html":"https://pith.science/pith/WKVMSLH62WPLO5P3R5ZWACEWZI","download_json":"https://pith.science/pith/WKVMSLH62WPLO5P3R5ZWACEWZI.json","view_paper":"https://pith.science/paper/WKVMSLH6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.04331&json=true","fetch_graph":"https://pith.science/api/pith-number/WKVMSLH62WPLO5P3R5ZWACEWZI/graph.json","fetch_events":"https://pith.science/api/pith-number/WKVMSLH62WPLO5P3R5ZWACEWZI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WKVMSLH62WPLO5P3R5ZWACEWZI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WKVMSLH62WPLO5P3R5ZWACEWZI/action/storage_attestation","attest_author":"https://pith.science/pith/WKVMSLH62WPLO5P3R5ZWACEWZI/action/author_attestation","sign_citation":"https://pith.science/pith/WKVMSLH62WPLO5P3R5ZWACEWZI/action/citation_signature","submit_replication":"https://pith.science/pith/WKVMSLH62WPLO5P3R5ZWACEWZI/action/replication_record"}},"created_at":"2026-05-17T23:47:15.911883+00:00","updated_at":"2026-05-17T23:47:15.911883+00:00"}