{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:J75CXMU6JFEUONEFGX5H2C23MF","short_pith_number":"pith:J75CXMU6","schema_version":"1.0","canonical_sha256":"4ffa2bb29e494947348535fa7d0b5b615a7bbb8d6386bbff763a44a1121dabfa","source":{"kind":"arxiv","id":"1906.05363","version":2},"attestation_state":"computed","paper":{"title":"Competing Bandits in Matching Markets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.MA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Horia Mania, Lydia T. Liu, Michael I. Jordan","submitted_at":"2019-06-12T20:04:25Z","abstract_excerpt":"Stable matching, a classical model for two-sided markets, has long been studied with little consideration for how each side's preferences are learned. With the advent of massive online markets powered by data-driven matching platforms, it has become necessary to better understand the interplay between learning and market objectives. We propose a statistical learning model in which one side of the market does not have a priori knowledge about its preferences for the other side and is required to learn these from stochastic rewards. Our model extends the standard multi-armed bandits framework to"},"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":"1906.05363","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-12T20:04:25Z","cross_cats_sorted":["cs.GT","cs.MA","stat.ML"],"title_canon_sha256":"72b92a0ec9678c2498c578898f9a425de7fd55ddcdd74f427814f0cb7c8ee5e6","abstract_canon_sha256":"f19122eb2d4348ff521cf206f57783fa0bde99ee224b0d068b9963aaf4d42108"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:17:57.028751Z","signature_b64":"e/U3YeSPImd1Ax8HkVHiBEYEHRJ98IqUdWI4TcsnJwLfbz/Cp3BmnE/S7XCnlUc1osazR5GBbRGyh7wU8eDXBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ffa2bb29e494947348535fa7d0b5b615a7bbb8d6386bbff763a44a1121dabfa","last_reissued_at":"2026-07-05T01:17:57.028286Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:17:57.028286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Competing Bandits in Matching Markets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.MA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Horia Mania, Lydia T. Liu, Michael I. Jordan","submitted_at":"2019-06-12T20:04:25Z","abstract_excerpt":"Stable matching, a classical model for two-sided markets, has long been studied with little consideration for how each side's preferences are learned. With the advent of massive online markets powered by data-driven matching platforms, it has become necessary to better understand the interplay between learning and market objectives. We propose a statistical learning model in which one side of the market does not have a priori knowledge about its preferences for the other side and is required to learn these from stochastic rewards. Our model extends the standard multi-armed bandits framework to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05363","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1906.05363/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":"1906.05363","created_at":"2026-07-05T01:17:57.028363+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.05363v2","created_at":"2026-07-05T01:17:57.028363+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05363","created_at":"2026-07-05T01:17:57.028363+00:00"},{"alias_kind":"pith_short_12","alias_value":"J75CXMU6JFEU","created_at":"2026-07-05T01:17:57.028363+00:00"},{"alias_kind":"pith_short_16","alias_value":"J75CXMU6JFEUONEF","created_at":"2026-07-05T01:17:57.028363+00:00"},{"alias_kind":"pith_short_8","alias_value":"J75CXMU6","created_at":"2026-07-05T01:17:57.028363+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2306.04498","citing_title":"Near-Optimal Privacy-Preserving Learning for Max-Min Fair Multi-Agent Bandits","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J75CXMU6JFEUONEFGX5H2C23MF","json":"https://pith.science/pith/J75CXMU6JFEUONEFGX5H2C23MF.json","graph_json":"https://pith.science/api/pith-number/J75CXMU6JFEUONEFGX5H2C23MF/graph.json","events_json":"https://pith.science/api/pith-number/J75CXMU6JFEUONEFGX5H2C23MF/events.json","paper":"https://pith.science/paper/J75CXMU6"},"agent_actions":{"view_html":"https://pith.science/pith/J75CXMU6JFEUONEFGX5H2C23MF","download_json":"https://pith.science/pith/J75CXMU6JFEUONEFGX5H2C23MF.json","view_paper":"https://pith.science/paper/J75CXMU6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.05363&json=true","fetch_graph":"https://pith.science/api/pith-number/J75CXMU6JFEUONEFGX5H2C23MF/graph.json","fetch_events":"https://pith.science/api/pith-number/J75CXMU6JFEUONEFGX5H2C23MF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J75CXMU6JFEUONEFGX5H2C23MF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J75CXMU6JFEUONEFGX5H2C23MF/action/storage_attestation","attest_author":"https://pith.science/pith/J75CXMU6JFEUONEFGX5H2C23MF/action/author_attestation","sign_citation":"https://pith.science/pith/J75CXMU6JFEUONEFGX5H2C23MF/action/citation_signature","submit_replication":"https://pith.science/pith/J75CXMU6JFEUONEFGX5H2C23MF/action/replication_record"}},"created_at":"2026-07-05T01:17:57.028363+00:00","updated_at":"2026-07-05T01:17:57.028363+00:00"}