{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:SDDWJMSGAVUX26SE5J67QIZVQ7","short_pith_number":"pith:SDDWJMSG","schema_version":"1.0","canonical_sha256":"90c764b24605697d7a44ea7df8233587e78995cb23677463b99b71c40a73a825","source":{"kind":"arxiv","id":"2505.24637","version":2},"attestation_state":"computed","paper":{"title":"Note on the size of a stable matching","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"econ.TH","authors_text":"Anders Yeo, Gregory Z. Gutin, Philip R. Neary","submitted_at":"2025-05-30T14:25:54Z","abstract_excerpt":"Consider a one-to-one two-sided matching market with workers on one side and single-position firms on the other, and suppose that the largest individually rational matching contains $n$ pairs. We show that the number of workers employed and positions filled in every stable matching is bounded from below by $\\lceil\\frac{n}{2}\\rceil$ and we characterise the class of preferences that attain the bound. We then identify the minimum number of equilibrium pairings that must be ``sacrificed'' when maximising the employment rate is the objective; if each stable matching is of size $\\ceiling{\\frac{n}{2}"},"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":"2505.24637","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"econ.TH","submitted_at":"2025-05-30T14:25:54Z","cross_cats_sorted":[],"title_canon_sha256":"6e52abebb6fa89319699a3b54b5f640738bb58cb082c2bcbe0fbb176afeb3ab9","abstract_canon_sha256":"17c3dc3cad8fc6f4f6927a22d9a26c65dcfd35dee26c38614bcb90f81e10f2a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-26T01:15:44.340725Z","signature_b64":"sygR5/mV7UTZGWZlv+cRduldocZ2zkCg+nRYjzTN+pzWxwgcdalw4ZyL6eGJxEp4Wl5a5hg5KEelNDDpbl2lDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90c764b24605697d7a44ea7df8233587e78995cb23677463b99b71c40a73a825","last_reissued_at":"2026-06-26T01:15:44.340234Z","signature_status":"signed_v1","first_computed_at":"2026-06-26T01:15:44.340234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Note on the size of a stable matching","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"econ.TH","authors_text":"Anders Yeo, Gregory Z. Gutin, Philip R. Neary","submitted_at":"2025-05-30T14:25:54Z","abstract_excerpt":"Consider a one-to-one two-sided matching market with workers on one side and single-position firms on the other, and suppose that the largest individually rational matching contains $n$ pairs. We show that the number of workers employed and positions filled in every stable matching is bounded from below by $\\lceil\\frac{n}{2}\\rceil$ and we characterise the class of preferences that attain the bound. We then identify the minimum number of equilibrium pairings that must be ``sacrificed'' when maximising the employment rate is the objective; if each stable matching is of size $\\ceiling{\\frac{n}{2}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.24637","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/2505.24637/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":"2505.24637","created_at":"2026-06-26T01:15:44.340290+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.24637v2","created_at":"2026-06-26T01:15:44.340290+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.24637","created_at":"2026-06-26T01:15:44.340290+00:00"},{"alias_kind":"pith_short_12","alias_value":"SDDWJMSGAVUX","created_at":"2026-06-26T01:15:44.340290+00:00"},{"alias_kind":"pith_short_16","alias_value":"SDDWJMSGAVUX26SE","created_at":"2026-06-26T01:15:44.340290+00:00"},{"alias_kind":"pith_short_8","alias_value":"SDDWJMSG","created_at":"2026-06-26T01:15:44.340290+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/SDDWJMSGAVUX26SE5J67QIZVQ7","json":"https://pith.science/pith/SDDWJMSGAVUX26SE5J67QIZVQ7.json","graph_json":"https://pith.science/api/pith-number/SDDWJMSGAVUX26SE5J67QIZVQ7/graph.json","events_json":"https://pith.science/api/pith-number/SDDWJMSGAVUX26SE5J67QIZVQ7/events.json","paper":"https://pith.science/paper/SDDWJMSG"},"agent_actions":{"view_html":"https://pith.science/pith/SDDWJMSGAVUX26SE5J67QIZVQ7","download_json":"https://pith.science/pith/SDDWJMSGAVUX26SE5J67QIZVQ7.json","view_paper":"https://pith.science/paper/SDDWJMSG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.24637&json=true","fetch_graph":"https://pith.science/api/pith-number/SDDWJMSGAVUX26SE5J67QIZVQ7/graph.json","fetch_events":"https://pith.science/api/pith-number/SDDWJMSGAVUX26SE5J67QIZVQ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SDDWJMSGAVUX26SE5J67QIZVQ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SDDWJMSGAVUX26SE5J67QIZVQ7/action/storage_attestation","attest_author":"https://pith.science/pith/SDDWJMSGAVUX26SE5J67QIZVQ7/action/author_attestation","sign_citation":"https://pith.science/pith/SDDWJMSGAVUX26SE5J67QIZVQ7/action/citation_signature","submit_replication":"https://pith.science/pith/SDDWJMSGAVUX26SE5J67QIZVQ7/action/replication_record"}},"created_at":"2026-06-26T01:15:44.340290+00:00","updated_at":"2026-06-26T01:15:44.340290+00:00"}