{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:TPJO6UC6RN2U7GZJ7JPOFSRNQ5","short_pith_number":"pith:TPJO6UC6","schema_version":"1.0","canonical_sha256":"9bd2ef505e8b754f9b29fa5ee2ca2d87401183409cf71b258e6e08d9a42995cf","source":{"kind":"arxiv","id":"1703.04225","version":1},"attestation_state":"computed","paper":{"title":"New algorithms for matching problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Jacky Lo, Mark C. Wilson","submitted_at":"2017-03-13T02:05:58Z","abstract_excerpt":"The standard two-sided and one-sided matching problems, and the closely related school choice problem, have been widely studied from an axiomatic viewpoint. A small number of algorithms dominate the literature. For two-sided matching, the Gale-Shapley algorithm; for one-sided matching, (random) Serial Dictatorship and Probabilistic Serial rule; for school choice, Gale-Shapley and the Boston mechanisms.\n  The main reason for the dominance of these algorithms is their good (worst-case) axiomatic behaviour with respect to notions of efficiency and strategyproofness. However if we shift the focus "},"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":"1703.04225","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2017-03-13T02:05:58Z","cross_cats_sorted":[],"title_canon_sha256":"5566e4d3544e1907a774d1d7e20bc401dc1673e4be667d1e6b0858beecfabbfc","abstract_canon_sha256":"f55810c79392820586a63badc322ffe5bb03dcd330e5fae66b2f753c31f1bb2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:49.380758Z","signature_b64":"f+PozaBXqXw00qSxmmIZUlYiqpdkahSnb8ePkGOT0dEtvIecHsp1q1/pu8CAzUlfUtUwSqX2HvGacMA1p5dJCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9bd2ef505e8b754f9b29fa5ee2ca2d87401183409cf71b258e6e08d9a42995cf","last_reissued_at":"2026-05-18T00:48:49.379936Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:49.379936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New algorithms for matching problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Jacky Lo, Mark C. Wilson","submitted_at":"2017-03-13T02:05:58Z","abstract_excerpt":"The standard two-sided and one-sided matching problems, and the closely related school choice problem, have been widely studied from an axiomatic viewpoint. A small number of algorithms dominate the literature. For two-sided matching, the Gale-Shapley algorithm; for one-sided matching, (random) Serial Dictatorship and Probabilistic Serial rule; for school choice, Gale-Shapley and the Boston mechanisms.\n  The main reason for the dominance of these algorithms is their good (worst-case) axiomatic behaviour with respect to notions of efficiency and strategyproofness. However if we shift the focus "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.04225","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":""},"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":"1703.04225","created_at":"2026-05-18T00:48:49.380070+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.04225v1","created_at":"2026-05-18T00:48:49.380070+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04225","created_at":"2026-05-18T00:48:49.380070+00:00"},{"alias_kind":"pith_short_12","alias_value":"TPJO6UC6RN2U","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"TPJO6UC6RN2U7GZJ","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"TPJO6UC6","created_at":"2026-05-18T12:31:46.661854+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/TPJO6UC6RN2U7GZJ7JPOFSRNQ5","json":"https://pith.science/pith/TPJO6UC6RN2U7GZJ7JPOFSRNQ5.json","graph_json":"https://pith.science/api/pith-number/TPJO6UC6RN2U7GZJ7JPOFSRNQ5/graph.json","events_json":"https://pith.science/api/pith-number/TPJO6UC6RN2U7GZJ7JPOFSRNQ5/events.json","paper":"https://pith.science/paper/TPJO6UC6"},"agent_actions":{"view_html":"https://pith.science/pith/TPJO6UC6RN2U7GZJ7JPOFSRNQ5","download_json":"https://pith.science/pith/TPJO6UC6RN2U7GZJ7JPOFSRNQ5.json","view_paper":"https://pith.science/paper/TPJO6UC6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.04225&json=true","fetch_graph":"https://pith.science/api/pith-number/TPJO6UC6RN2U7GZJ7JPOFSRNQ5/graph.json","fetch_events":"https://pith.science/api/pith-number/TPJO6UC6RN2U7GZJ7JPOFSRNQ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TPJO6UC6RN2U7GZJ7JPOFSRNQ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TPJO6UC6RN2U7GZJ7JPOFSRNQ5/action/storage_attestation","attest_author":"https://pith.science/pith/TPJO6UC6RN2U7GZJ7JPOFSRNQ5/action/author_attestation","sign_citation":"https://pith.science/pith/TPJO6UC6RN2U7GZJ7JPOFSRNQ5/action/citation_signature","submit_replication":"https://pith.science/pith/TPJO6UC6RN2U7GZJ7JPOFSRNQ5/action/replication_record"}},"created_at":"2026-05-18T00:48:49.380070+00:00","updated_at":"2026-05-18T00:48:49.380070+00:00"}