{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:ZCP6JKJD7B4KKQISI43N5L6BE7","short_pith_number":"pith:ZCP6JKJD","schema_version":"1.0","canonical_sha256":"c89fe4a923f878a541124736deafc127c77fccab555dde0343839f5ee1032121","source":{"kind":"arxiv","id":"2205.12881","version":1},"attestation_state":"computed","paper":{"title":"A Continuum Model of Stable Matching With Finite Capacities","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"econ.TH","authors_text":"Nick Arnosti","submitted_at":"2022-05-25T16:05:41Z","abstract_excerpt":"This paper introduces a unified framework for stable matching, which nests the traditional definition of stable matching in finite markets and the continuum definition of stable matching from Azevedo and Leshno (2016) as special cases. Within this framework, I identify a novel continuum model, which makes individual-level probabilistic predictions.\n  This new model always has a unique stable outcome, which can be found using an analog of the Deferred Acceptance algorithm. The crucial difference between this model and that of Azevedo and Leshno (2016) is that they assume that the amount of stud"},"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":"2205.12881","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"econ.TH","submitted_at":"2022-05-25T16:05:41Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"d60892acf1b07e51e1d466940678891ec9c005add8f7a5ed237327929dc0c90e","abstract_canon_sha256":"0226ecf16108ea512a33fbe5c66cf810a76d5708bb2068a87b9f8fe65e602613"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:26:30.495500Z","signature_b64":"iEZfo9BEALkddUg+GPWe5Q0MKfvSfTqrh5f+/AUhrarbzRBKPvWeqqaVgKKnaHJaj8FSajiTrOwpWtXBjpI3AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c89fe4a923f878a541124736deafc127c77fccab555dde0343839f5ee1032121","last_reissued_at":"2026-07-05T04:26:30.495132Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:26:30.495132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Continuum Model of Stable Matching With Finite Capacities","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"econ.TH","authors_text":"Nick Arnosti","submitted_at":"2022-05-25T16:05:41Z","abstract_excerpt":"This paper introduces a unified framework for stable matching, which nests the traditional definition of stable matching in finite markets and the continuum definition of stable matching from Azevedo and Leshno (2016) as special cases. Within this framework, I identify a novel continuum model, which makes individual-level probabilistic predictions.\n  This new model always has a unique stable outcome, which can be found using an analog of the Deferred Acceptance algorithm. The crucial difference between this model and that of Azevedo and Leshno (2016) is that they assume that the amount of stud"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.12881","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2205.12881/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":"2205.12881","created_at":"2026-07-05T04:26:30.495182+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.12881v1","created_at":"2026-07-05T04:26:30.495182+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.12881","created_at":"2026-07-05T04:26:30.495182+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZCP6JKJD7B4K","created_at":"2026-07-05T04:26:30.495182+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZCP6JKJD7B4KKQIS","created_at":"2026-07-05T04:26:30.495182+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZCP6JKJD","created_at":"2026-07-05T04:26:30.495182+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.06217","citing_title":"Longer Lists Yield Better Matchings","ref_index":2022,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZCP6JKJD7B4KKQISI43N5L6BE7","json":"https://pith.science/pith/ZCP6JKJD7B4KKQISI43N5L6BE7.json","graph_json":"https://pith.science/api/pith-number/ZCP6JKJD7B4KKQISI43N5L6BE7/graph.json","events_json":"https://pith.science/api/pith-number/ZCP6JKJD7B4KKQISI43N5L6BE7/events.json","paper":"https://pith.science/paper/ZCP6JKJD"},"agent_actions":{"view_html":"https://pith.science/pith/ZCP6JKJD7B4KKQISI43N5L6BE7","download_json":"https://pith.science/pith/ZCP6JKJD7B4KKQISI43N5L6BE7.json","view_paper":"https://pith.science/paper/ZCP6JKJD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.12881&json=true","fetch_graph":"https://pith.science/api/pith-number/ZCP6JKJD7B4KKQISI43N5L6BE7/graph.json","fetch_events":"https://pith.science/api/pith-number/ZCP6JKJD7B4KKQISI43N5L6BE7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZCP6JKJD7B4KKQISI43N5L6BE7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZCP6JKJD7B4KKQISI43N5L6BE7/action/storage_attestation","attest_author":"https://pith.science/pith/ZCP6JKJD7B4KKQISI43N5L6BE7/action/author_attestation","sign_citation":"https://pith.science/pith/ZCP6JKJD7B4KKQISI43N5L6BE7/action/citation_signature","submit_replication":"https://pith.science/pith/ZCP6JKJD7B4KKQISI43N5L6BE7/action/replication_record"}},"created_at":"2026-07-05T04:26:30.495182+00:00","updated_at":"2026-07-05T04:26:30.495182+00:00"}