{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4JILYYXOI4GRAAADSUGU3KWIT5","short_pith_number":"pith:4JILYYXO","schema_version":"1.0","canonical_sha256":"e250bc62ee470d100003950d4daac89f5a8e5114cc29d398cd1952c91b99ba03","source":{"kind":"arxiv","id":"1403.0974","version":3},"attestation_state":"computed","paper":{"title":"Parametrized Algorithms for Random Serial Dictatorship","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Haris Aziz, Juli\\'an Mestre","submitted_at":"2014-03-04T23:25:44Z","abstract_excerpt":"Voting and assignment are two of the most fundamental settings in social choice theory. For both settings, random serial dictatorship (RSD) is a well-known rule that satisfies anonymity, ex post efficiency, and strategyproofness. Recently, it was shown that computing the resulting probabilities is #P-complete both in the voting and assignment setting. In this paper, we study RSD from a parametrized complexity perspective. More specifically, we present efficient algorithms to compute the RSD probabilities under the condition that the number of agent types, alternatives, or objects is bounded."},"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":"1403.0974","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-03-04T23:25:44Z","cross_cats_sorted":[],"title_canon_sha256":"c3a202d22948048893a0b3abb06ab05d6eb7ecf5a8483bddef038a4a25d10bb9","abstract_canon_sha256":"9f9ac58de7831b8b77c7804d81c707f24d03c3c72bda6b446e7185a358a47401"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:57.953794Z","signature_b64":"gkWixMn+tG3VS5/KGMVC7K79uC6XlYk+GqM4uvyjeE5aAJgPadxzXrbbbIB6UGm1TSbZec/maeDg+tejVZ6NCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e250bc62ee470d100003950d4daac89f5a8e5114cc29d398cd1952c91b99ba03","last_reissued_at":"2026-05-18T02:45:57.953301Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:57.953301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parametrized Algorithms for Random Serial Dictatorship","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Haris Aziz, Juli\\'an Mestre","submitted_at":"2014-03-04T23:25:44Z","abstract_excerpt":"Voting and assignment are two of the most fundamental settings in social choice theory. For both settings, random serial dictatorship (RSD) is a well-known rule that satisfies anonymity, ex post efficiency, and strategyproofness. Recently, it was shown that computing the resulting probabilities is #P-complete both in the voting and assignment setting. In this paper, we study RSD from a parametrized complexity perspective. More specifically, we present efficient algorithms to compute the RSD probabilities under the condition that the number of agent types, alternatives, or objects is bounded."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.0974","kind":"arxiv","version":3},"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":"1403.0974","created_at":"2026-05-18T02:45:57.953389+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.0974v3","created_at":"2026-05-18T02:45:57.953389+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.0974","created_at":"2026-05-18T02:45:57.953389+00:00"},{"alias_kind":"pith_short_12","alias_value":"4JILYYXOI4GR","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4JILYYXOI4GRAAAD","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4JILYYXO","created_at":"2026-05-18T12:28:14.216126+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/4JILYYXOI4GRAAADSUGU3KWIT5","json":"https://pith.science/pith/4JILYYXOI4GRAAADSUGU3KWIT5.json","graph_json":"https://pith.science/api/pith-number/4JILYYXOI4GRAAADSUGU3KWIT5/graph.json","events_json":"https://pith.science/api/pith-number/4JILYYXOI4GRAAADSUGU3KWIT5/events.json","paper":"https://pith.science/paper/4JILYYXO"},"agent_actions":{"view_html":"https://pith.science/pith/4JILYYXOI4GRAAADSUGU3KWIT5","download_json":"https://pith.science/pith/4JILYYXOI4GRAAADSUGU3KWIT5.json","view_paper":"https://pith.science/paper/4JILYYXO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.0974&json=true","fetch_graph":"https://pith.science/api/pith-number/4JILYYXOI4GRAAADSUGU3KWIT5/graph.json","fetch_events":"https://pith.science/api/pith-number/4JILYYXOI4GRAAADSUGU3KWIT5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4JILYYXOI4GRAAADSUGU3KWIT5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4JILYYXOI4GRAAADSUGU3KWIT5/action/storage_attestation","attest_author":"https://pith.science/pith/4JILYYXOI4GRAAADSUGU3KWIT5/action/author_attestation","sign_citation":"https://pith.science/pith/4JILYYXOI4GRAAADSUGU3KWIT5/action/citation_signature","submit_replication":"https://pith.science/pith/4JILYYXOI4GRAAADSUGU3KWIT5/action/replication_record"}},"created_at":"2026-05-18T02:45:57.953389+00:00","updated_at":"2026-05-18T02:45:57.953389+00:00"}