{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:2DZPKW4L5GQVUJTXPUDV5GTNMB","short_pith_number":"pith:2DZPKW4L","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"},"canonical_sha256":"d0f2f55b8be9a15a26777d075e9a6d606ef2c3f80188e53ef875a2eba7c02783","source":{"kind":"arxiv","id":"0911.5660","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.5660","created_at":"2026-05-18T02:54:54Z"},{"alias_kind":"arxiv_version","alias_value":"0911.5660v5","created_at":"2026-05-18T02:54:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.5660","created_at":"2026-05-18T02:54:54Z"},{"alias_kind":"pith_short_12","alias_value":"2DZPKW4L5GQV","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"2DZPKW4L5GQVUJTX","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"2DZPKW4L","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:2DZPKW4L5GQVUJTXPUDV5GTNMB","target":"record","payload":{"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"},"canonical_sha256":"d0f2f55b8be9a15a26777d075e9a6d606ef2c3f80188e53ef875a2eba7c02783","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"},"source_kind":"arxiv","source_id":"0911.5660","source_version":5,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:54:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XINuTyVuflkgK6m5FuUbSf90t6HgEfkaFjvAyomjfw1CqavS7axZ8EmE58zduxljv4R+AexNIv/57AVzL88WBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T17:02:14.856478Z"},"content_sha256":"8ed35c785c8aaa21889306b3d1c51ca4a8e80a36f5e359e76e67ac3238db6e5d","schema_version":"1.0","event_id":"sha256:8ed35c785c8aaa21889306b3d1c51ca4a8e80a36f5e359e76e67ac3238db6e5d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:2DZPKW4L5GQVUJTXPUDV5GTNMB","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:54:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q6U70lUUkPZQnhlXAgiztz2Kf3A8E2yJbwWIrzplfVwi46wftCGU6L69/1c3LUlVq3Hq/UhqN1xrKrhg7IQFDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T17:02:14.856823Z"},"content_sha256":"07ca1999dbadfc3d87ab74084b6ffdbf1d5d2d0f737b410030a08e8391fa2551","schema_version":"1.0","event_id":"sha256:07ca1999dbadfc3d87ab74084b6ffdbf1d5d2d0f737b410030a08e8391fa2551"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2DZPKW4L5GQVUJTXPUDV5GTNMB/bundle.json","state_url":"https://pith.science/pith/2DZPKW4L5GQVUJTXPUDV5GTNMB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2DZPKW4L5GQVUJTXPUDV5GTNMB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-25T17:02:14Z","links":{"resolver":"https://pith.science/pith/2DZPKW4L5GQVUJTXPUDV5GTNMB","bundle":"https://pith.science/pith/2DZPKW4L5GQVUJTXPUDV5GTNMB/bundle.json","state":"https://pith.science/pith/2DZPKW4L5GQVUJTXPUDV5GTNMB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2DZPKW4L5GQVUJTXPUDV5GTNMB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:2DZPKW4L5GQVUJTXPUDV5GTNMB","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8ee99be98118e2a258e67d84ac4aaaa4ec6c02d0abda30c5602396c6e3386f95","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-11-30T14:44:35Z","title_canon_sha256":"0505b5d9e0fa823cec54c829de80fe9c969e5b1c5d8a499d085b6e51ddfb6f71"},"schema_version":"1.0","source":{"id":"0911.5660","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.5660","created_at":"2026-05-18T02:54:54Z"},{"alias_kind":"arxiv_version","alias_value":"0911.5660v5","created_at":"2026-05-18T02:54:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.5660","created_at":"2026-05-18T02:54:54Z"},{"alias_kind":"pith_short_12","alias_value":"2DZPKW4L5GQV","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"2DZPKW4L5GQVUJTX","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"2DZPKW4L","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:07ca1999dbadfc3d87ab74084b6ffdbf1d5d2d0f737b410030a08e8391fa2551","target":"graph","created_at":"2026-05-18T02:54:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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)","authors_text":"Katarzyna Paluch","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-11-30T14:44:35Z","title":"Faster and simpler approximation of stable matchings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.5660","kind":"arxiv","version":5},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8ed35c785c8aaa21889306b3d1c51ca4a8e80a36f5e359e76e67ac3238db6e5d","target":"record","created_at":"2026-05-18T02:54:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8ee99be98118e2a258e67d84ac4aaaa4ec6c02d0abda30c5602396c6e3386f95","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-11-30T14:44:35Z","title_canon_sha256":"0505b5d9e0fa823cec54c829de80fe9c969e5b1c5d8a499d085b6e51ddfb6f71"},"schema_version":"1.0","source":{"id":"0911.5660","kind":"arxiv","version":5}},"canonical_sha256":"d0f2f55b8be9a15a26777d075e9a6d606ef2c3f80188e53ef875a2eba7c02783","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d0f2f55b8be9a15a26777d075e9a6d606ef2c3f80188e53ef875a2eba7c02783","first_computed_at":"2026-05-18T02:54:54.566053Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:54.566053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P55eO1DQhZcTFLOEBP6B1+Fe9D4c8LATz0zrfbviwh+cjl/pexUd+dgdWtgErckaYi515GGW7oRwqoZ3+OW7AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:54.566868Z","signed_message":"canonical_sha256_bytes"},"source_id":"0911.5660","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ed35c785c8aaa21889306b3d1c51ca4a8e80a36f5e359e76e67ac3238db6e5d","sha256:07ca1999dbadfc3d87ab74084b6ffdbf1d5d2d0f737b410030a08e8391fa2551"],"state_sha256":"f897d2946a98a5409353c437e9a090edc1380db105e1b95a7060c59b3911835c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fIrfyjmmWv1YvxLAyl0JpimmQC/SJk6Sdu6QVOnT0sA7widtp02npoRfaLapxy1gGxGyC9PGHMM2mZNuWRv8DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T17:02:14.858681Z","bundle_sha256":"633b88a3f0fe4fe113b5753aad27a6f4e6d7be2525d135b06d1a4e0fd3ddd723"}}