{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YEUMQR3ZPO5RIGTGCYE2EPUU73","short_pith_number":"pith:YEUMQR3Z","schema_version":"1.0","canonical_sha256":"c128c847797bbb141a661609a23e94fecc9dffea3f79c1334d004376972349b6","source":{"kind":"arxiv","id":"1609.02795","version":2},"attestation_state":"computed","paper":{"title":"Pareto Optimal Allocation under Uncertain Preferences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Baharak Rastegari, Haris Aziz, Ronald de Haan","submitted_at":"2016-09-09T13:53:58Z","abstract_excerpt":"The assignment problem is one of the most well-studied settings in social choice, matching, and discrete allocation. We consider the problem with the additional feature that agents' preferences involve uncertainty. The setting with uncertainty leads to a number of interesting questions including the following ones. How to compute an assignment with the highest probability of being Pareto optimal? What is the complexity of computing the probability that a given assignment is Pareto optimal? Does there exist an assignment that is Pareto optimal with probability one? We consider these problems un"},"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":"1609.02795","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-09-09T13:53:58Z","cross_cats_sorted":[],"title_canon_sha256":"0e9e21e2f1b76894780fac1e04d0328de28373c9478eb127cd80af8f3ea12357","abstract_canon_sha256":"fda0b368b9705f282974a2b7421d68160ced3120775897b73400b8876de79eac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:51.775100Z","signature_b64":"9sw9h2k3ED9V/qokm34U09cqPbhR7KnOw32ErbhbNFN/nJrPJ2i0sW5CGgmDUcUyVhfOW02Ax+n6G7AZYhzwAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c128c847797bbb141a661609a23e94fecc9dffea3f79c1334d004376972349b6","last_reissued_at":"2026-05-18T01:02:51.774704Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:51.774704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pareto Optimal Allocation under Uncertain Preferences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Baharak Rastegari, Haris Aziz, Ronald de Haan","submitted_at":"2016-09-09T13:53:58Z","abstract_excerpt":"The assignment problem is one of the most well-studied settings in social choice, matching, and discrete allocation. We consider the problem with the additional feature that agents' preferences involve uncertainty. The setting with uncertainty leads to a number of interesting questions including the following ones. How to compute an assignment with the highest probability of being Pareto optimal? What is the complexity of computing the probability that a given assignment is Pareto optimal? Does there exist an assignment that is Pareto optimal with probability one? We consider these problems un"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.02795","kind":"arxiv","version":2},"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":"1609.02795","created_at":"2026-05-18T01:02:51.774766+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.02795v2","created_at":"2026-05-18T01:02:51.774766+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.02795","created_at":"2026-05-18T01:02:51.774766+00:00"},{"alias_kind":"pith_short_12","alias_value":"YEUMQR3ZPO5R","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YEUMQR3ZPO5RIGTG","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YEUMQR3Z","created_at":"2026-05-18T12:30:53.716459+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/YEUMQR3ZPO5RIGTGCYE2EPUU73","json":"https://pith.science/pith/YEUMQR3ZPO5RIGTGCYE2EPUU73.json","graph_json":"https://pith.science/api/pith-number/YEUMQR3ZPO5RIGTGCYE2EPUU73/graph.json","events_json":"https://pith.science/api/pith-number/YEUMQR3ZPO5RIGTGCYE2EPUU73/events.json","paper":"https://pith.science/paper/YEUMQR3Z"},"agent_actions":{"view_html":"https://pith.science/pith/YEUMQR3ZPO5RIGTGCYE2EPUU73","download_json":"https://pith.science/pith/YEUMQR3ZPO5RIGTGCYE2EPUU73.json","view_paper":"https://pith.science/paper/YEUMQR3Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.02795&json=true","fetch_graph":"https://pith.science/api/pith-number/YEUMQR3ZPO5RIGTGCYE2EPUU73/graph.json","fetch_events":"https://pith.science/api/pith-number/YEUMQR3ZPO5RIGTGCYE2EPUU73/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YEUMQR3ZPO5RIGTGCYE2EPUU73/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YEUMQR3ZPO5RIGTGCYE2EPUU73/action/storage_attestation","attest_author":"https://pith.science/pith/YEUMQR3ZPO5RIGTGCYE2EPUU73/action/author_attestation","sign_citation":"https://pith.science/pith/YEUMQR3ZPO5RIGTGCYE2EPUU73/action/citation_signature","submit_replication":"https://pith.science/pith/YEUMQR3ZPO5RIGTGCYE2EPUU73/action/replication_record"}},"created_at":"2026-05-18T01:02:51.774766+00:00","updated_at":"2026-05-18T01:02:51.774766+00:00"}