{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:OKSV445OK577XZXV3AM5ER54KH","short_pith_number":"pith:OKSV445O","schema_version":"1.0","canonical_sha256":"72a55e73ae577ffbe6f5d819d247bc51eca4d423c28c4ed60755c9b0b039bded","source":{"kind":"arxiv","id":"2607.24970","version":1},"attestation_state":"computed","paper":{"title":"Asymptotic Equivalence of Immediate and Deferred Acceptance","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"econ.TH","authors_text":"Josue Ortega","submitted_at":"2026-07-27T18:22:05Z","abstract_excerpt":"Immediate Acceptance (IA, also known as the Boston mechanism) is commonly used to assign students to schools because it produces a Pareto-efficient matching if parents report their preferences over schools truthfully, unlike student-proposing Deferred Acceptance (DA). In this paper, we ask: does IA produce meaningfully better average ranks than DA, conditional on truth-telling? We show that, in i.i.d. one-to-one random markets, IA's expected average rank is asymptotically $\\log n$, just like DA's. Therefore, IA's Pareto efficiency does not translate into a first-order improvement in expected a"},"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":"2607.24970","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"econ.TH","submitted_at":"2026-07-27T18:22:05Z","cross_cats_sorted":[],"title_canon_sha256":"17383aeee0ec586cd7d1e8bead656b048068af720e8b4fe371450b5d7fcd1a30","abstract_canon_sha256":"98059a1cb520ff2734a471ec0771319da3f565e0c362c19ecdc78c222ed46bd9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-29T00:24:55.709081Z","signature_b64":"CpyGxZor+gzncGnlGTQziE8QghJqfjY80/fokaCxfyBaWgRh385uj5ZTA2YUtzlgQP4fL3cgk50NfpIYJhbWDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72a55e73ae577ffbe6f5d819d247bc51eca4d423c28c4ed60755c9b0b039bded","last_reissued_at":"2026-07-29T00:24:55.708144Z","signature_status":"signed_v1","first_computed_at":"2026-07-29T00:24:55.708144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotic Equivalence of Immediate and Deferred Acceptance","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"econ.TH","authors_text":"Josue Ortega","submitted_at":"2026-07-27T18:22:05Z","abstract_excerpt":"Immediate Acceptance (IA, also known as the Boston mechanism) is commonly used to assign students to schools because it produces a Pareto-efficient matching if parents report their preferences over schools truthfully, unlike student-proposing Deferred Acceptance (DA). In this paper, we ask: does IA produce meaningfully better average ranks than DA, conditional on truth-telling? We show that, in i.i.d. one-to-one random markets, IA's expected average rank is asymptotically $\\log n$, just like DA's. Therefore, IA's Pareto efficiency does not translate into a first-order improvement in expected a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.24970","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/2607.24970/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":"2607.24970","created_at":"2026-07-29T00:24:55.708628+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.24970v1","created_at":"2026-07-29T00:24:55.708628+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.24970","created_at":"2026-07-29T00:24:55.708628+00:00"},{"alias_kind":"pith_short_12","alias_value":"OKSV445OK577","created_at":"2026-07-29T00:24:55.708628+00:00"},{"alias_kind":"pith_short_16","alias_value":"OKSV445OK577XZXV","created_at":"2026-07-29T00:24:55.708628+00:00"},{"alias_kind":"pith_short_8","alias_value":"OKSV445O","created_at":"2026-07-29T00:24:55.708628+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.09984","citing_title":"Efficiency Adjustments Break the Logarithmic Rank Barrier","ref_index":2022,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OKSV445OK577XZXV3AM5ER54KH","json":"https://pith.science/pith/OKSV445OK577XZXV3AM5ER54KH.json","graph_json":"https://pith.science/api/pith-number/OKSV445OK577XZXV3AM5ER54KH/graph.json","events_json":"https://pith.science/api/pith-number/OKSV445OK577XZXV3AM5ER54KH/events.json","paper":"https://pith.science/paper/OKSV445O"},"agent_actions":{"view_html":"https://pith.science/pith/OKSV445OK577XZXV3AM5ER54KH","download_json":"https://pith.science/pith/OKSV445OK577XZXV3AM5ER54KH.json","view_paper":"https://pith.science/paper/OKSV445O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.24970&json=true","fetch_graph":"https://pith.science/api/pith-number/OKSV445OK577XZXV3AM5ER54KH/graph.json","fetch_events":"https://pith.science/api/pith-number/OKSV445OK577XZXV3AM5ER54KH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OKSV445OK577XZXV3AM5ER54KH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OKSV445OK577XZXV3AM5ER54KH/action/storage_attestation","attest_author":"https://pith.science/pith/OKSV445OK577XZXV3AM5ER54KH/action/author_attestation","sign_citation":"https://pith.science/pith/OKSV445OK577XZXV3AM5ER54KH/action/citation_signature","submit_replication":"https://pith.science/pith/OKSV445OK577XZXV3AM5ER54KH/action/replication_record"}},"created_at":"2026-07-29T00:24:55.708628+00:00","updated_at":"2026-07-29T00:24:55.708628+00:00"}