{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:X3ETKAPJ3WXH2OR4I4FC2E5ZRI","short_pith_number":"pith:X3ETKAPJ","schema_version":"1.0","canonical_sha256":"bec93501e9ddae7d3a3c470a2d13b98a0529419c1e759eafd5c4dbca14bbe1bb","source":{"kind":"arxiv","id":"1607.02917","version":1},"attestation_state":"computed","paper":{"title":"Stable Matching with Uncertain Linear Preferences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Baharak Rastegari, Haris Aziz, Nicholas Mattei, P\\'eter Bir\\'o, Ronald de Haan, Serge Gaspers","submitted_at":"2016-07-11T12:19:14Z","abstract_excerpt":"We consider the two-sided stable matching setting in which there may be uncertainty about the agents' preferences due to limited information or communication. We consider three models of uncertainty: (1) lottery model --- in which for each agent, there is a probability distribution over linear preferences, (2) compact indifference model --- for each agent, a weak preference order is specified and each linear order compatible with the weak order is equally likely and (3) joint probability model --- there is a lottery over preference profiles. For each of the models, we study the computational c"},"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":"1607.02917","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-07-11T12:19:14Z","cross_cats_sorted":[],"title_canon_sha256":"d3e2182be836c7f08efa337215c66fd7df74670f516ed761d37e90d8c14d3259","abstract_canon_sha256":"9c6c27b0402a2f9376e56c441b6c7951ce3879430ce6041f18b28125515f0e17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:14.385003Z","signature_b64":"W/FbbM2PEM6dTCQIHof95+lZzpH5zFU4VGOZ1KX+koz/4+W/BTRM6cJTEElKgHJvTzdPTJ5mNEjAdOIVqui+Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bec93501e9ddae7d3a3c470a2d13b98a0529419c1e759eafd5c4dbca14bbe1bb","last_reissued_at":"2026-05-18T01:11:14.384396Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:14.384396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stable Matching with Uncertain Linear Preferences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Baharak Rastegari, Haris Aziz, Nicholas Mattei, P\\'eter Bir\\'o, Ronald de Haan, Serge Gaspers","submitted_at":"2016-07-11T12:19:14Z","abstract_excerpt":"We consider the two-sided stable matching setting in which there may be uncertainty about the agents' preferences due to limited information or communication. We consider three models of uncertainty: (1) lottery model --- in which for each agent, there is a probability distribution over linear preferences, (2) compact indifference model --- for each agent, a weak preference order is specified and each linear order compatible with the weak order is equally likely and (3) joint probability model --- there is a lottery over preference profiles. For each of the models, we study the computational c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02917","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1607.02917","created_at":"2026-05-18T01:11:14.384496+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.02917v1","created_at":"2026-05-18T01:11:14.384496+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02917","created_at":"2026-05-18T01:11:14.384496+00:00"},{"alias_kind":"pith_short_12","alias_value":"X3ETKAPJ3WXH","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"X3ETKAPJ3WXH2OR4","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"X3ETKAPJ","created_at":"2026-05-18T12:30:51.357362+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/X3ETKAPJ3WXH2OR4I4FC2E5ZRI","json":"https://pith.science/pith/X3ETKAPJ3WXH2OR4I4FC2E5ZRI.json","graph_json":"https://pith.science/api/pith-number/X3ETKAPJ3WXH2OR4I4FC2E5ZRI/graph.json","events_json":"https://pith.science/api/pith-number/X3ETKAPJ3WXH2OR4I4FC2E5ZRI/events.json","paper":"https://pith.science/paper/X3ETKAPJ"},"agent_actions":{"view_html":"https://pith.science/pith/X3ETKAPJ3WXH2OR4I4FC2E5ZRI","download_json":"https://pith.science/pith/X3ETKAPJ3WXH2OR4I4FC2E5ZRI.json","view_paper":"https://pith.science/paper/X3ETKAPJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.02917&json=true","fetch_graph":"https://pith.science/api/pith-number/X3ETKAPJ3WXH2OR4I4FC2E5ZRI/graph.json","fetch_events":"https://pith.science/api/pith-number/X3ETKAPJ3WXH2OR4I4FC2E5ZRI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X3ETKAPJ3WXH2OR4I4FC2E5ZRI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X3ETKAPJ3WXH2OR4I4FC2E5ZRI/action/storage_attestation","attest_author":"https://pith.science/pith/X3ETKAPJ3WXH2OR4I4FC2E5ZRI/action/author_attestation","sign_citation":"https://pith.science/pith/X3ETKAPJ3WXH2OR4I4FC2E5ZRI/action/citation_signature","submit_replication":"https://pith.science/pith/X3ETKAPJ3WXH2OR4I4FC2E5ZRI/action/replication_record"}},"created_at":"2026-05-18T01:11:14.384496+00:00","updated_at":"2026-05-18T01:11:14.384496+00:00"}