{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:2DZPKW4L5GQVUJTXPUDV5GTNMB","short_pith_number":"pith:2DZPKW4L","schema_version":"1.0","canonical_sha256":"d0f2f55b8be9a15a26777d075e9a6d606ef2c3f80188e53ef875a2eba7c02783","source":{"kind":"arxiv","id":"0911.5660","version":5},"attestation_state":"computed","paper":{"title":"Faster and simpler approximation of stable matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Katarzyna Paluch","submitted_at":"2009-11-30T14:44:35Z","abstract_excerpt":"We give a 3/2-approximation algorithm for stable matchings that runs in $O(m)$ time. The previously best known algorithm by McDermid has the same approximation ratio but runs in $O(n^{3/2}m)$ time, where $n$ denotes the number of people and $m$ is the total length of the preference lists in a given instance. Also the algorithm and the analysis are much simpler. We also give the extension of the algorithm for the many-to-many setting.\n  (This is the version of the paper from March 2011)"},"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":"0911.5660","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-11-30T14:44:35Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0505b5d9e0fa823cec54c829de80fe9c969e5b1c5d8a499d085b6e51ddfb6f71","abstract_canon_sha256":"8ee99be98118e2a258e67d84ac4aaaa4ec6c02d0abda30c5602396c6e3386f95"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:54.566868Z","signature_b64":"P55eO1DQhZcTFLOEBP6B1+Fe9D4c8LATz0zrfbviwh+cjl/pexUd+dgdWtgErckaYi515GGW7oRwqoZ3+OW7AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0f2f55b8be9a15a26777d075e9a6d606ef2c3f80188e53ef875a2eba7c02783","last_reissued_at":"2026-05-18T02:54:54.566053Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:54.566053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster and simpler approximation of stable matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Katarzyna Paluch","submitted_at":"2009-11-30T14:44:35Z","abstract_excerpt":"We give a 3/2-approximation algorithm for stable matchings that runs in $O(m)$ time. The previously best known algorithm by McDermid has the same approximation ratio but runs in $O(n^{3/2}m)$ time, where $n$ denotes the number of people and $m$ is the total length of the preference lists in a given instance. Also the algorithm and the analysis are much simpler. We also give the extension of the algorithm for the many-to-many setting.\n  (This is the version of the paper from March 2011)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.5660","kind":"arxiv","version":5},"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":"0911.5660","created_at":"2026-05-18T02:54:54.566193+00:00"},{"alias_kind":"arxiv_version","alias_value":"0911.5660v5","created_at":"2026-05-18T02:54:54.566193+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.5660","created_at":"2026-05-18T02:54:54.566193+00:00"},{"alias_kind":"pith_short_12","alias_value":"2DZPKW4L5GQV","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_16","alias_value":"2DZPKW4L5GQVUJTX","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_8","alias_value":"2DZPKW4L","created_at":"2026-05-18T12:25:58.018023+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/2DZPKW4L5GQVUJTXPUDV5GTNMB","json":"https://pith.science/pith/2DZPKW4L5GQVUJTXPUDV5GTNMB.json","graph_json":"https://pith.science/api/pith-number/2DZPKW4L5GQVUJTXPUDV5GTNMB/graph.json","events_json":"https://pith.science/api/pith-number/2DZPKW4L5GQVUJTXPUDV5GTNMB/events.json","paper":"https://pith.science/paper/2DZPKW4L"},"agent_actions":{"view_html":"https://pith.science/pith/2DZPKW4L5GQVUJTXPUDV5GTNMB","download_json":"https://pith.science/pith/2DZPKW4L5GQVUJTXPUDV5GTNMB.json","view_paper":"https://pith.science/paper/2DZPKW4L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0911.5660&json=true","fetch_graph":"https://pith.science/api/pith-number/2DZPKW4L5GQVUJTXPUDV5GTNMB/graph.json","fetch_events":"https://pith.science/api/pith-number/2DZPKW4L5GQVUJTXPUDV5GTNMB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2DZPKW4L5GQVUJTXPUDV5GTNMB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2DZPKW4L5GQVUJTXPUDV5GTNMB/action/storage_attestation","attest_author":"https://pith.science/pith/2DZPKW4L5GQVUJTXPUDV5GTNMB/action/author_attestation","sign_citation":"https://pith.science/pith/2DZPKW4L5GQVUJTXPUDV5GTNMB/action/citation_signature","submit_replication":"https://pith.science/pith/2DZPKW4L5GQVUJTXPUDV5GTNMB/action/replication_record"}},"created_at":"2026-05-18T02:54:54.566193+00:00","updated_at":"2026-05-18T02:54:54.566193+00:00"}