{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4JILYYXOI4GRAAADSUGU3KWIT5","short_pith_number":"pith:4JILYYXO","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"},"canonical_sha256":"e250bc62ee470d100003950d4daac89f5a8e5114cc29d398cd1952c91b99ba03","source":{"kind":"arxiv","id":"1403.0974","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.0974","created_at":"2026-05-18T02:45:57Z"},{"alias_kind":"arxiv_version","alias_value":"1403.0974v3","created_at":"2026-05-18T02:45:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.0974","created_at":"2026-05-18T02:45:57Z"},{"alias_kind":"pith_short_12","alias_value":"4JILYYXOI4GR","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4JILYYXOI4GRAAAD","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4JILYYXO","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4JILYYXOI4GRAAADSUGU3KWIT5","target":"record","payload":{"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"},"canonical_sha256":"e250bc62ee470d100003950d4daac89f5a8e5114cc29d398cd1952c91b99ba03","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"},"source_kind":"arxiv","source_id":"1403.0974","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:45:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PgSV+Yfg7oXhBdzgvruRtzrfQVBJbvqkg87WOG74AkShrqg+OovvF026QFf342+g5unceJw4vk/ZyjkU+pRLCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:55:21.993105Z"},"content_sha256":"d458e1d5457ea460fdcdb24b2399715dbd19086d385223857e089cc086343b49","schema_version":"1.0","event_id":"sha256:d458e1d5457ea460fdcdb24b2399715dbd19086d385223857e089cc086343b49"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4JILYYXOI4GRAAADSUGU3KWIT5","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:45:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3BdLPiW6ABe8CqwUBGFlb7VU/rp55CE/iC3Nj3jBfyRmOGPlHyVenR2YySGrFHESxCRjkoA68KVnzHd2dHpTBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:55:21.993489Z"},"content_sha256":"803ff30befcf0d663ba0c8224c2a98c6da2768081e9a3e6425f909f418716a50","schema_version":"1.0","event_id":"sha256:803ff30befcf0d663ba0c8224c2a98c6da2768081e9a3e6425f909f418716a50"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4JILYYXOI4GRAAADSUGU3KWIT5/bundle.json","state_url":"https://pith.science/pith/4JILYYXOI4GRAAADSUGU3KWIT5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4JILYYXOI4GRAAADSUGU3KWIT5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T15:55:21Z","links":{"resolver":"https://pith.science/pith/4JILYYXOI4GRAAADSUGU3KWIT5","bundle":"https://pith.science/pith/4JILYYXOI4GRAAADSUGU3KWIT5/bundle.json","state":"https://pith.science/pith/4JILYYXOI4GRAAADSUGU3KWIT5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4JILYYXOI4GRAAADSUGU3KWIT5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4JILYYXOI4GRAAADSUGU3KWIT5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9f9ac58de7831b8b77c7804d81c707f24d03c3c72bda6b446e7185a358a47401","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-03-04T23:25:44Z","title_canon_sha256":"c3a202d22948048893a0b3abb06ab05d6eb7ecf5a8483bddef038a4a25d10bb9"},"schema_version":"1.0","source":{"id":"1403.0974","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.0974","created_at":"2026-05-18T02:45:57Z"},{"alias_kind":"arxiv_version","alias_value":"1403.0974v3","created_at":"2026-05-18T02:45:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.0974","created_at":"2026-05-18T02:45:57Z"},{"alias_kind":"pith_short_12","alias_value":"4JILYYXOI4GR","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4JILYYXOI4GRAAAD","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4JILYYXO","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:803ff30befcf0d663ba0c8224c2a98c6da2768081e9a3e6425f909f418716a50","target":"graph","created_at":"2026-05-18T02:45:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Haris Aziz, Juli\\'an Mestre","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-03-04T23:25:44Z","title":"Parametrized Algorithms for Random Serial Dictatorship"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.0974","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d458e1d5457ea460fdcdb24b2399715dbd19086d385223857e089cc086343b49","target":"record","created_at":"2026-05-18T02:45:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"9f9ac58de7831b8b77c7804d81c707f24d03c3c72bda6b446e7185a358a47401","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-03-04T23:25:44Z","title_canon_sha256":"c3a202d22948048893a0b3abb06ab05d6eb7ecf5a8483bddef038a4a25d10bb9"},"schema_version":"1.0","source":{"id":"1403.0974","kind":"arxiv","version":3}},"canonical_sha256":"e250bc62ee470d100003950d4daac89f5a8e5114cc29d398cd1952c91b99ba03","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e250bc62ee470d100003950d4daac89f5a8e5114cc29d398cd1952c91b99ba03","first_computed_at":"2026-05-18T02:45:57.953301Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:57.953301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gkWixMn+tG3VS5/KGMVC7K79uC6XlYk+GqM4uvyjeE5aAJgPadxzXrbbbIB6UGm1TSbZec/maeDg+tejVZ6NCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:57.953794Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.0974","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d458e1d5457ea460fdcdb24b2399715dbd19086d385223857e089cc086343b49","sha256:803ff30befcf0d663ba0c8224c2a98c6da2768081e9a3e6425f909f418716a50"],"state_sha256":"86491cd5c858d0a8153a1d502396db6f9d016c770c44dec037afbf820de3704e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D0lyEioapSkVEWZ16EBNsanHj5FbXW/UJbtHdRTojYq+oEBONFk18sXDE9/aQtqUZ4bZFs3EkWruolPq9vaiAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T15:55:21.995658Z","bundle_sha256":"c1ead00690f06454e509964b3280269bcf8a30df1f227a9547f4a47ad43dfd90"}}