{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:66GNTGJJA5YL4WVPKXOWRXC2V2","short_pith_number":"pith:66GNTGJJ","canonical_record":{"source":{"id":"1401.6523","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-01-25T12:11:09Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8102f95d35f1c520a7ec2c674d48784596b22ecfe9a82871b2ad3b953654d3d3","abstract_canon_sha256":"785a64b598b033aadba601f818bf3416edf541ff319e2d9ca4adf5cab7a1e517"},"schema_version":"1.0"},"canonical_sha256":"f78cd999290770be5aaf55dd68dc5aae99cce100a6ecadd3c6b132af144d2354","source":{"kind":"arxiv","id":"1401.6523","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6523","created_at":"2026-05-18T03:01:01Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6523v1","created_at":"2026-05-18T03:01:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6523","created_at":"2026-05-18T03:01:01Z"},{"alias_kind":"pith_short_12","alias_value":"66GNTGJJA5YL","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"66GNTGJJA5YL4WVP","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"66GNTGJJ","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:66GNTGJJA5YL4WVPKXOWRXC2V2","target":"record","payload":{"canonical_record":{"source":{"id":"1401.6523","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-01-25T12:11:09Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8102f95d35f1c520a7ec2c674d48784596b22ecfe9a82871b2ad3b953654d3d3","abstract_canon_sha256":"785a64b598b033aadba601f818bf3416edf541ff319e2d9ca4adf5cab7a1e517"},"schema_version":"1.0"},"canonical_sha256":"f78cd999290770be5aaf55dd68dc5aae99cce100a6ecadd3c6b132af144d2354","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:01.480544Z","signature_b64":"01sQg07FRFraayhfpOiwaEPUHhg1ahxZFssDNYoMCjcQtx+2bRj7bm9TpUMJFySPOLW6ajyHgQGU2QeWWkuwDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f78cd999290770be5aaf55dd68dc5aae99cce100a6ecadd3c6b132af144d2354","last_reissued_at":"2026-05-18T03:01:01.479792Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:01.479792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.6523","source_version":1,"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-18T03:01:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ELW08sx+lFBe5oX9+gO3AfncSwTn5b3/jwW+ujnjuJghka5vlKcZCkUnEFexUjQmn5yqP3r24Ljg1LjRnwShAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:57:35.244333Z"},"content_sha256":"4e8a7a6086379dccec287e2cb53318fa0aa0b25ada202906819597823e92d1ec","schema_version":"1.0","event_id":"sha256:4e8a7a6086379dccec287e2cb53318fa0aa0b25ada202906819597823e92d1ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:66GNTGJJA5YL4WVPKXOWRXC2V2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strategic aspects of the probabilistic serial rule for the allocation of goods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Haris Aziz, Nick Mattei, Nina Narodytska, Serge Gaspers, Toby Walsh","submitted_at":"2014-01-25T12:11:09Z","abstract_excerpt":"The probabilistic serial (PS) rule is one of the most prominent randomized rules for the assignment problem. It is well-known for its superior fairness and welfare properties. However, PS is not immune to manipulative behaviour by the agents. We examine computational and non-computational aspects of strategising under the PS rule. Firstly, we study the computational complexity of an agent manipulating the PS rule. We present polynomial-time algorithms for optimal manipulation. Secondly, we show that expected utility best responses can cycle. Thirdly, we examine the existence and computation of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6523","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":""},"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-18T03:01:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XLcvK6fuNMjy2m2ZfIhAeV4s8GiUzvcoak3zpN6v2kUd0+5RoznbsdbqiJ9l9msZGocqRIG3f53c3CSaPsMjBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:57:35.244747Z"},"content_sha256":"1ea145c77718ae6416ee579cd4de02d4da6652fe4f612b9ed05e985f8b3724bd","schema_version":"1.0","event_id":"sha256:1ea145c77718ae6416ee579cd4de02d4da6652fe4f612b9ed05e985f8b3724bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/66GNTGJJA5YL4WVPKXOWRXC2V2/bundle.json","state_url":"https://pith.science/pith/66GNTGJJA5YL4WVPKXOWRXC2V2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/66GNTGJJA5YL4WVPKXOWRXC2V2/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-27T19:57:35Z","links":{"resolver":"https://pith.science/pith/66GNTGJJA5YL4WVPKXOWRXC2V2","bundle":"https://pith.science/pith/66GNTGJJA5YL4WVPKXOWRXC2V2/bundle.json","state":"https://pith.science/pith/66GNTGJJA5YL4WVPKXOWRXC2V2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/66GNTGJJA5YL4WVPKXOWRXC2V2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:66GNTGJJA5YL4WVPKXOWRXC2V2","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":"785a64b598b033aadba601f818bf3416edf541ff319e2d9ca4adf5cab7a1e517","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-01-25T12:11:09Z","title_canon_sha256":"8102f95d35f1c520a7ec2c674d48784596b22ecfe9a82871b2ad3b953654d3d3"},"schema_version":"1.0","source":{"id":"1401.6523","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6523","created_at":"2026-05-18T03:01:01Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6523v1","created_at":"2026-05-18T03:01:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6523","created_at":"2026-05-18T03:01:01Z"},{"alias_kind":"pith_short_12","alias_value":"66GNTGJJA5YL","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"66GNTGJJA5YL4WVP","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"66GNTGJJ","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:1ea145c77718ae6416ee579cd4de02d4da6652fe4f612b9ed05e985f8b3724bd","target":"graph","created_at":"2026-05-18T03:01:01Z","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":"The probabilistic serial (PS) rule is one of the most prominent randomized rules for the assignment problem. It is well-known for its superior fairness and welfare properties. However, PS is not immune to manipulative behaviour by the agents. We examine computational and non-computational aspects of strategising under the PS rule. Firstly, we study the computational complexity of an agent manipulating the PS rule. We present polynomial-time algorithms for optimal manipulation. Secondly, we show that expected utility best responses can cycle. Thirdly, we examine the existence and computation of","authors_text":"Haris Aziz, Nick Mattei, Nina Narodytska, Serge Gaspers, Toby Walsh","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-01-25T12:11:09Z","title":"Strategic aspects of the probabilistic serial rule for the allocation of goods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6523","kind":"arxiv","version":1},"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:4e8a7a6086379dccec287e2cb53318fa0aa0b25ada202906819597823e92d1ec","target":"record","created_at":"2026-05-18T03:01:01Z","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":"785a64b598b033aadba601f818bf3416edf541ff319e2d9ca4adf5cab7a1e517","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-01-25T12:11:09Z","title_canon_sha256":"8102f95d35f1c520a7ec2c674d48784596b22ecfe9a82871b2ad3b953654d3d3"},"schema_version":"1.0","source":{"id":"1401.6523","kind":"arxiv","version":1}},"canonical_sha256":"f78cd999290770be5aaf55dd68dc5aae99cce100a6ecadd3c6b132af144d2354","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f78cd999290770be5aaf55dd68dc5aae99cce100a6ecadd3c6b132af144d2354","first_computed_at":"2026-05-18T03:01:01.479792Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:01.479792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"01sQg07FRFraayhfpOiwaEPUHhg1ahxZFssDNYoMCjcQtx+2bRj7bm9TpUMJFySPOLW6ajyHgQGU2QeWWkuwDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:01.480544Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.6523","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e8a7a6086379dccec287e2cb53318fa0aa0b25ada202906819597823e92d1ec","sha256:1ea145c77718ae6416ee579cd4de02d4da6652fe4f612b9ed05e985f8b3724bd"],"state_sha256":"20a401f920ce957e7ee703eba1bff794d3172bd2066a1939c7a862ff8198f5b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F6FFa1AIc0Ymf2KUxWim2jTSceSdBudYL483t57q+AOm7FnWc8Co6TKH0BaaKin0RPNZ1BM90V4+ut6iqF9tAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:57:35.247241Z","bundle_sha256":"4d96266fd7542efe539468f7fbc0aa49d8f78b7c3da4347fe95765dc62334191"}}