{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:6YFRJK6B6GIIO3LMPXVK2JD3GP","short_pith_number":"pith:6YFRJK6B","schema_version":"1.0","canonical_sha256":"f60b14abc1f190876d6c7deaad247b33fd5699ddef9ee69a2ff1d511872c2328","source":{"kind":"arxiv","id":"2102.06988","version":3},"attestation_state":"computed","paper":{"title":"Learning in Multi-Stage Decentralized Matching Markets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.GT","authors_text":"Michael I. Jordan, Xiaowu Dai","submitted_at":"2021-02-13T19:25:52Z","abstract_excerpt":"Matching markets are often organized in a multi-stage and decentralized manner. Moreover, participants in real-world matching markets often have uncertain preferences. This article develops a framework for learning optimal strategies in such settings, based on a nonparametric statistical approach and variational analysis. We propose an efficient algorithm, built upon concepts of \"lower uncertainty bound\" and \"calibrated decentralized matching,\" for maximizing the participants' expected payoff. We show that there exists a welfare-versus-fairness trade-off that is characterized by the uncertaint"},"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":"2102.06988","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2021-02-13T19:25:52Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7821124eb609228348c3b623a00928c8ffba77c8b86e61632ecedb88b40006fa","abstract_canon_sha256":"a3ed00371ff04dc1e2c29dca6da2a948f036c04f4da3387170a2404cdd0bc940"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:41:59.677835Z","signature_b64":"90il8I/0jir4f2CthF/H0JjREOZMJdcYvs6gHN+f1venrJyrp3sprin3dERz28e8GmDxC3VMNkgSIs84vVdADg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f60b14abc1f190876d6c7deaad247b33fd5699ddef9ee69a2ff1d511872c2328","last_reissued_at":"2026-07-05T03:41:59.677477Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:41:59.677477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning in Multi-Stage Decentralized Matching Markets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.GT","authors_text":"Michael I. Jordan, Xiaowu Dai","submitted_at":"2021-02-13T19:25:52Z","abstract_excerpt":"Matching markets are often organized in a multi-stage and decentralized manner. Moreover, participants in real-world matching markets often have uncertain preferences. This article develops a framework for learning optimal strategies in such settings, based on a nonparametric statistical approach and variational analysis. We propose an efficient algorithm, built upon concepts of \"lower uncertainty bound\" and \"calibrated decentralized matching,\" for maximizing the participants' expected payoff. We show that there exists a welfare-versus-fairness trade-off that is characterized by the uncertaint"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.06988","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2102.06988/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2102.06988","created_at":"2026-07-05T03:41:59.677539+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.06988v3","created_at":"2026-07-05T03:41:59.677539+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.06988","created_at":"2026-07-05T03:41:59.677539+00:00"},{"alias_kind":"pith_short_12","alias_value":"6YFRJK6B6GII","created_at":"2026-07-05T03:41:59.677539+00:00"},{"alias_kind":"pith_short_16","alias_value":"6YFRJK6B6GIIO3LM","created_at":"2026-07-05T03:41:59.677539+00:00"},{"alias_kind":"pith_short_8","alias_value":"6YFRJK6B","created_at":"2026-07-05T03:41:59.677539+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/6YFRJK6B6GIIO3LMPXVK2JD3GP","json":"https://pith.science/pith/6YFRJK6B6GIIO3LMPXVK2JD3GP.json","graph_json":"https://pith.science/api/pith-number/6YFRJK6B6GIIO3LMPXVK2JD3GP/graph.json","events_json":"https://pith.science/api/pith-number/6YFRJK6B6GIIO3LMPXVK2JD3GP/events.json","paper":"https://pith.science/paper/6YFRJK6B"},"agent_actions":{"view_html":"https://pith.science/pith/6YFRJK6B6GIIO3LMPXVK2JD3GP","download_json":"https://pith.science/pith/6YFRJK6B6GIIO3LMPXVK2JD3GP.json","view_paper":"https://pith.science/paper/6YFRJK6B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.06988&json=true","fetch_graph":"https://pith.science/api/pith-number/6YFRJK6B6GIIO3LMPXVK2JD3GP/graph.json","fetch_events":"https://pith.science/api/pith-number/6YFRJK6B6GIIO3LMPXVK2JD3GP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6YFRJK6B6GIIO3LMPXVK2JD3GP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6YFRJK6B6GIIO3LMPXVK2JD3GP/action/storage_attestation","attest_author":"https://pith.science/pith/6YFRJK6B6GIIO3LMPXVK2JD3GP/action/author_attestation","sign_citation":"https://pith.science/pith/6YFRJK6B6GIIO3LMPXVK2JD3GP/action/citation_signature","submit_replication":"https://pith.science/pith/6YFRJK6B6GIIO3LMPXVK2JD3GP/action/replication_record"}},"created_at":"2026-07-05T03:41:59.677539+00:00","updated_at":"2026-07-05T03:41:59.677539+00:00"}