{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:LDAUPYZYVHSHRMVKETVMDZY5VN","short_pith_number":"pith:LDAUPYZY","canonical_record":{"source":{"id":"1312.6546","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-12-23T13:37:19Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"436a516a66be08f83c8fb78ae61ac9fc38d0783b716eb72924316d38023ffff8","abstract_canon_sha256":"898c3e974638fdf23a703e4a1f71c7ff268907a3a62aaf35b5588ce55108f624"},"schema_version":"1.0"},"canonical_sha256":"58c147e338a9e478b2aa24eac1e71dab7a7991173ec2e539a0c0453ce57ef004","source":{"kind":"arxiv","id":"1312.6546","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.6546","created_at":"2026-05-18T01:46:14Z"},{"alias_kind":"arxiv_version","alias_value":"1312.6546v4","created_at":"2026-05-18T01:46:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6546","created_at":"2026-05-18T01:46:14Z"},{"alias_kind":"pith_short_12","alias_value":"LDAUPYZYVHSH","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LDAUPYZYVHSHRMVK","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LDAUPYZY","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:LDAUPYZYVHSHRMVKETVMDZY5VN","target":"record","payload":{"canonical_record":{"source":{"id":"1312.6546","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-12-23T13:37:19Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"436a516a66be08f83c8fb78ae61ac9fc38d0783b716eb72924316d38023ffff8","abstract_canon_sha256":"898c3e974638fdf23a703e4a1f71c7ff268907a3a62aaf35b5588ce55108f624"},"schema_version":"1.0"},"canonical_sha256":"58c147e338a9e478b2aa24eac1e71dab7a7991173ec2e539a0c0453ce57ef004","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:46:14.244861Z","signature_b64":"unUG9j/6CjtOk7j75e8Y+5w9ctrbuScboVfKguIAROdbB/25MnUROxHWkX8OIyFRGq6uAApeH+fWGGyUa+I5Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58c147e338a9e478b2aa24eac1e71dab7a7991173ec2e539a0c0453ce57ef004","last_reissued_at":"2026-05-18T01:46:14.244110Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:46:14.244110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.6546","source_version":4,"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-18T01:46:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"buP3ZWFEhKLeNPQ1nfhhKCPUzAE2k7GdR9ff0UK7mAjFqfq63oagD9lkYw3CT4617hzCOLMm4mU6+dnK2piBDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:57:45.862294Z"},"content_sha256":"a4db6f71520266d35374105d4156cc74b860eb0efd9ad0fc018a243120004a14","schema_version":"1.0","event_id":"sha256:a4db6f71520266d35374105d4156cc74b860eb0efd9ad0fc018a243120004a14"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:LDAUPYZYVHSHRMVKETVMDZY5VN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fair assignment of indivisible objects under ordinal preferences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.GT","authors_text":"Haris Aziz, Serge Gaspers, Simon Mackenzie, Toby Walsh","submitted_at":"2013-12-23T13:37:19Z","abstract_excerpt":"We consider the discrete assignment problem in which agents express ordinal preferences over objects and these objects are allocated to the agents in a fair manner. We use the stochastic dominance relation between fractional or randomized allocations to systematically define varying notions of proportionality and envy-freeness for discrete assignments. The computational complexity of checking whether a fair assignment exists is studied for these fairness notions. We also characterize the conditions under which a fair assignment is guaranteed to exist. For a number of fairness concepts, polynom"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6546","kind":"arxiv","version":4},"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-18T01:46:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pfP1tqs0j9ED2sZRvgCuomzhwaOO6NqJcTX+4ugN9GPn+NPQUaFT85ynEM8+cdrDPShkrdlmvqUNTRwl3ncrCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:57:45.862658Z"},"content_sha256":"cf59f9ec9b2dbcaa40e65b6ea82782ab8d30ef863b2823e4b986ea61f6db29a2","schema_version":"1.0","event_id":"sha256:cf59f9ec9b2dbcaa40e65b6ea82782ab8d30ef863b2823e4b986ea61f6db29a2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LDAUPYZYVHSHRMVKETVMDZY5VN/bundle.json","state_url":"https://pith.science/pith/LDAUPYZYVHSHRMVKETVMDZY5VN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LDAUPYZYVHSHRMVKETVMDZY5VN/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-27T16:57:45Z","links":{"resolver":"https://pith.science/pith/LDAUPYZYVHSHRMVKETVMDZY5VN","bundle":"https://pith.science/pith/LDAUPYZYVHSHRMVKETVMDZY5VN/bundle.json","state":"https://pith.science/pith/LDAUPYZYVHSHRMVKETVMDZY5VN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LDAUPYZYVHSHRMVKETVMDZY5VN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:LDAUPYZYVHSHRMVKETVMDZY5VN","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":"898c3e974638fdf23a703e4a1f71c7ff268907a3a62aaf35b5588ce55108f624","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-12-23T13:37:19Z","title_canon_sha256":"436a516a66be08f83c8fb78ae61ac9fc38d0783b716eb72924316d38023ffff8"},"schema_version":"1.0","source":{"id":"1312.6546","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.6546","created_at":"2026-05-18T01:46:14Z"},{"alias_kind":"arxiv_version","alias_value":"1312.6546v4","created_at":"2026-05-18T01:46:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6546","created_at":"2026-05-18T01:46:14Z"},{"alias_kind":"pith_short_12","alias_value":"LDAUPYZYVHSH","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LDAUPYZYVHSHRMVK","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LDAUPYZY","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:cf59f9ec9b2dbcaa40e65b6ea82782ab8d30ef863b2823e4b986ea61f6db29a2","target":"graph","created_at":"2026-05-18T01:46:14Z","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":"We consider the discrete assignment problem in which agents express ordinal preferences over objects and these objects are allocated to the agents in a fair manner. We use the stochastic dominance relation between fractional or randomized allocations to systematically define varying notions of proportionality and envy-freeness for discrete assignments. The computational complexity of checking whether a fair assignment exists is studied for these fairness notions. We also characterize the conditions under which a fair assignment is guaranteed to exist. For a number of fairness concepts, polynom","authors_text":"Haris Aziz, Serge Gaspers, Simon Mackenzie, Toby Walsh","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-12-23T13:37:19Z","title":"Fair assignment of indivisible objects under ordinal preferences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6546","kind":"arxiv","version":4},"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:a4db6f71520266d35374105d4156cc74b860eb0efd9ad0fc018a243120004a14","target":"record","created_at":"2026-05-18T01:46:14Z","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":"898c3e974638fdf23a703e4a1f71c7ff268907a3a62aaf35b5588ce55108f624","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-12-23T13:37:19Z","title_canon_sha256":"436a516a66be08f83c8fb78ae61ac9fc38d0783b716eb72924316d38023ffff8"},"schema_version":"1.0","source":{"id":"1312.6546","kind":"arxiv","version":4}},"canonical_sha256":"58c147e338a9e478b2aa24eac1e71dab7a7991173ec2e539a0c0453ce57ef004","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58c147e338a9e478b2aa24eac1e71dab7a7991173ec2e539a0c0453ce57ef004","first_computed_at":"2026-05-18T01:46:14.244110Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:46:14.244110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"unUG9j/6CjtOk7j75e8Y+5w9ctrbuScboVfKguIAROdbB/25MnUROxHWkX8OIyFRGq6uAApeH+fWGGyUa+I5Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:46:14.244861Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.6546","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4db6f71520266d35374105d4156cc74b860eb0efd9ad0fc018a243120004a14","sha256:cf59f9ec9b2dbcaa40e65b6ea82782ab8d30ef863b2823e4b986ea61f6db29a2"],"state_sha256":"717bd2171ce53142ec8b26f5cc240388ddb84e46d41bf49b83e7a62eaae37644"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"45RGl3i0Q/ze3zwmcxrRudFxzrTmsgipU6tdSNE8siQ0koR2RoaQ0H36cRav3EtuSZvNnbt7HkVHIJKo6Ix5DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:57:45.866171Z","bundle_sha256":"f36439fe4d69f138d8f6e31189b8f29e5945c34239139e5887dc75936501dbaf"}}