{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:CRTKFHRSXKVCO2324FME2V7Y4S","short_pith_number":"pith:CRTKFHRS","canonical_record":{"source":{"id":"1409.6076","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-09-22T03:39:59Z","cross_cats_sorted":[],"title_canon_sha256":"cee2aa807021b2041405dd5629bf9edab387bffb9992723b55377dd8c5b6ec83","abstract_canon_sha256":"71c4990547738bf1fb15500badac5d96641e574f7127c28ec4a0f261d3de5580"},"schema_version":"1.0"},"canonical_sha256":"1466a29e32baaa276b7ae1584d57f8e496a30c7a56f78fa35f2f145e76622640","source":{"kind":"arxiv","id":"1409.6076","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.6076","created_at":"2026-05-18T02:42:13Z"},{"alias_kind":"arxiv_version","alias_value":"1409.6076v1","created_at":"2026-05-18T02:42:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.6076","created_at":"2026-05-18T02:42:13Z"},{"alias_kind":"pith_short_12","alias_value":"CRTKFHRSXKVC","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CRTKFHRSXKVCO232","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CRTKFHRS","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:CRTKFHRSXKVCO2324FME2V7Y4S","target":"record","payload":{"canonical_record":{"source":{"id":"1409.6076","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-09-22T03:39:59Z","cross_cats_sorted":[],"title_canon_sha256":"cee2aa807021b2041405dd5629bf9edab387bffb9992723b55377dd8c5b6ec83","abstract_canon_sha256":"71c4990547738bf1fb15500badac5d96641e574f7127c28ec4a0f261d3de5580"},"schema_version":"1.0"},"canonical_sha256":"1466a29e32baaa276b7ae1584d57f8e496a30c7a56f78fa35f2f145e76622640","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:13.810286Z","signature_b64":"i5Vjp+iNzj1Wr0OKPZmqeUmrVGfkLmiE9IWApzjjJibjwx7BtVUIUeebOhT16gx5fVh/91pW4gj5NZsE/3owAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1466a29e32baaa276b7ae1584d57f8e496a30c7a56f78fa35f2f145e76622640","last_reissued_at":"2026-05-18T02:42:13.809925Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:13.809925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.6076","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-18T02:42:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TiaaowBkmQtdUvKQPSVLuTeUUwmFJl+cXbsvCRPp9bLWGQjbAAnrZ4FYSOBJVBmoljusN7gLIHK/r8U4fDj6Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:17:56.399713Z"},"content_sha256":"03eb07134b6964b35629ce506a226597fc87aa1d2dcf16c80c18ca308b126c26","schema_version":"1.0","event_id":"sha256:03eb07134b6964b35629ce506a226597fc87aa1d2dcf16c80c18ca308b126c26"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:CRTKFHRSXKVCO2324FME2V7Y4S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structure and complexity of ex post efficient random assignments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Chun Ye, Haris Aziz, Lirong Xia, Simon Mackenzie","submitted_at":"2014-09-22T03:39:59Z","abstract_excerpt":"In the random assignment problem, objects are randomly assigned to agents keeping in view the agents' preferences over objects. A random assignment specifies the probability of an agent getting an object. We examine the structural and computational aspects of ex post efficiency of random assignments. We first show that whereas an ex post efficient assignment can be computed easily, checking whether a given random assignment is ex post efficient is NP-complete. Hence implementing a given random assignment via deterministic Pareto optimal assignments is NP-hard. We then formalize another concept"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.6076","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-18T02:42:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uiw52cf1GXyZOTddANnNNgg2S8K8N8W3JCmOWdfPpIL42rbGFFZ7c6dVl/ScXi3IR6RtzjEr1t8l6dYzxpXEAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:17:56.400081Z"},"content_sha256":"22f4c8e4b45dd5d530aea0ff7d6261d3e87e6fe47d0b43914ed3f21454b6ed4b","schema_version":"1.0","event_id":"sha256:22f4c8e4b45dd5d530aea0ff7d6261d3e87e6fe47d0b43914ed3f21454b6ed4b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CRTKFHRSXKVCO2324FME2V7Y4S/bundle.json","state_url":"https://pith.science/pith/CRTKFHRSXKVCO2324FME2V7Y4S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CRTKFHRSXKVCO2324FME2V7Y4S/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-06-02T02:17:56Z","links":{"resolver":"https://pith.science/pith/CRTKFHRSXKVCO2324FME2V7Y4S","bundle":"https://pith.science/pith/CRTKFHRSXKVCO2324FME2V7Y4S/bundle.json","state":"https://pith.science/pith/CRTKFHRSXKVCO2324FME2V7Y4S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CRTKFHRSXKVCO2324FME2V7Y4S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:CRTKFHRSXKVCO2324FME2V7Y4S","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":"71c4990547738bf1fb15500badac5d96641e574f7127c28ec4a0f261d3de5580","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-09-22T03:39:59Z","title_canon_sha256":"cee2aa807021b2041405dd5629bf9edab387bffb9992723b55377dd8c5b6ec83"},"schema_version":"1.0","source":{"id":"1409.6076","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.6076","created_at":"2026-05-18T02:42:13Z"},{"alias_kind":"arxiv_version","alias_value":"1409.6076v1","created_at":"2026-05-18T02:42:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.6076","created_at":"2026-05-18T02:42:13Z"},{"alias_kind":"pith_short_12","alias_value":"CRTKFHRSXKVC","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CRTKFHRSXKVCO232","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CRTKFHRS","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:22f4c8e4b45dd5d530aea0ff7d6261d3e87e6fe47d0b43914ed3f21454b6ed4b","target":"graph","created_at":"2026-05-18T02:42:13Z","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":"In the random assignment problem, objects are randomly assigned to agents keeping in view the agents' preferences over objects. A random assignment specifies the probability of an agent getting an object. We examine the structural and computational aspects of ex post efficiency of random assignments. We first show that whereas an ex post efficient assignment can be computed easily, checking whether a given random assignment is ex post efficient is NP-complete. Hence implementing a given random assignment via deterministic Pareto optimal assignments is NP-hard. We then formalize another concept","authors_text":"Chun Ye, Haris Aziz, Lirong Xia, Simon Mackenzie","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-09-22T03:39:59Z","title":"Structure and complexity of ex post efficient random assignments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.6076","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:03eb07134b6964b35629ce506a226597fc87aa1d2dcf16c80c18ca308b126c26","target":"record","created_at":"2026-05-18T02:42:13Z","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":"71c4990547738bf1fb15500badac5d96641e574f7127c28ec4a0f261d3de5580","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-09-22T03:39:59Z","title_canon_sha256":"cee2aa807021b2041405dd5629bf9edab387bffb9992723b55377dd8c5b6ec83"},"schema_version":"1.0","source":{"id":"1409.6076","kind":"arxiv","version":1}},"canonical_sha256":"1466a29e32baaa276b7ae1584d57f8e496a30c7a56f78fa35f2f145e76622640","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1466a29e32baaa276b7ae1584d57f8e496a30c7a56f78fa35f2f145e76622640","first_computed_at":"2026-05-18T02:42:13.809925Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:13.809925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i5Vjp+iNzj1Wr0OKPZmqeUmrVGfkLmiE9IWApzjjJibjwx7BtVUIUeebOhT16gx5fVh/91pW4gj5NZsE/3owAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:13.810286Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.6076","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:03eb07134b6964b35629ce506a226597fc87aa1d2dcf16c80c18ca308b126c26","sha256:22f4c8e4b45dd5d530aea0ff7d6261d3e87e6fe47d0b43914ed3f21454b6ed4b"],"state_sha256":"1e1aa8de6b7f948eb9d6503f59b2eef3e82fd14164a255fac2c0a11e35b40f0e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WKS4qPhlPBBeyVhy2F0lbn8nZ3sqqhSv+nl4ThQBaQP6EfCOECf9yFHGOlj8te0f9LsDBC0r0ym6MyIDHRgaCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T02:17:56.402245Z","bundle_sha256":"a530f0001aaf7aeedd6ea35a9c1c2840fc2c01c5f16cd7528da26a85cd5bab29"}}