{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:MKRKRDRZCCWWGIHPVX643L2ZFB","short_pith_number":"pith:MKRKRDRZ","schema_version":"1.0","canonical_sha256":"62a2a88e3910ad6320efadfdcdaf592851ed772795060ada0ccef67835046b8d","source":{"kind":"arxiv","id":"1112.0790","version":1},"attestation_state":"computed","paper":{"title":"Scaling algorithms for approximate and exact maximum weight matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hsin-Hao Su, Ran Duan, Seth Pettie","submitted_at":"2011-12-04T20:05:24Z","abstract_excerpt":"The {\\em maximum cardinality} and {\\em maximum weight matching} problems can be solved in time $\\tilde{O}(m\\sqrt{n})$, a bound that has resisted improvement despite decades of research. (Here $m$ and $n$ are the number of edges and vertices.) In this article we demonstrate that this \"$m\\sqrt{n}$ barrier\" is extremely fragile, in the following sense. For any $\\epsilon>0$, we give an algorithm that computes a $(1-\\epsilon)$-approximate maximum weight matching in $O(m\\epsilon^{-1}\\log\\epsilon^{-1})$ time, that is, optimal {\\em linear time} for any fixed $\\epsilon$. Our algorithm is dramatically s"},"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":"1112.0790","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-04T20:05:24Z","cross_cats_sorted":[],"title_canon_sha256":"da81c4c32386ed67b946f878769ec2dbdff69f483eb348fdcef2637cf0fa5031","abstract_canon_sha256":"0eca9563f8a1b7fbd165e37fa8f9b226edaace21eaf90b7df84c26ccb02c5c99"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:05.613176Z","signature_b64":"Fsq910D7wNlGRCBP3WmpeS191YQq4SLxXupJmBf0aU4Pnx6uEzSe57/2p78uY6LwaCdSn+AAyrkOycyixoxfCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62a2a88e3910ad6320efadfdcdaf592851ed772795060ada0ccef67835046b8d","last_reissued_at":"2026-05-18T04:07:05.612462Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:05.612462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scaling algorithms for approximate and exact maximum weight matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hsin-Hao Su, Ran Duan, Seth Pettie","submitted_at":"2011-12-04T20:05:24Z","abstract_excerpt":"The {\\em maximum cardinality} and {\\em maximum weight matching} problems can be solved in time $\\tilde{O}(m\\sqrt{n})$, a bound that has resisted improvement despite decades of research. (Here $m$ and $n$ are the number of edges and vertices.) In this article we demonstrate that this \"$m\\sqrt{n}$ barrier\" is extremely fragile, in the following sense. For any $\\epsilon>0$, we give an algorithm that computes a $(1-\\epsilon)$-approximate maximum weight matching in $O(m\\epsilon^{-1}\\log\\epsilon^{-1})$ time, that is, optimal {\\em linear time} for any fixed $\\epsilon$. Our algorithm is dramatically s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.0790","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":"1112.0790","created_at":"2026-05-18T04:07:05.612661+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.0790v1","created_at":"2026-05-18T04:07:05.612661+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0790","created_at":"2026-05-18T04:07:05.612661+00:00"},{"alias_kind":"pith_short_12","alias_value":"MKRKRDRZCCWW","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"MKRKRDRZCCWWGIHP","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"MKRKRDRZ","created_at":"2026-05-18T12:26:34.985390+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/MKRKRDRZCCWWGIHPVX643L2ZFB","json":"https://pith.science/pith/MKRKRDRZCCWWGIHPVX643L2ZFB.json","graph_json":"https://pith.science/api/pith-number/MKRKRDRZCCWWGIHPVX643L2ZFB/graph.json","events_json":"https://pith.science/api/pith-number/MKRKRDRZCCWWGIHPVX643L2ZFB/events.json","paper":"https://pith.science/paper/MKRKRDRZ"},"agent_actions":{"view_html":"https://pith.science/pith/MKRKRDRZCCWWGIHPVX643L2ZFB","download_json":"https://pith.science/pith/MKRKRDRZCCWWGIHPVX643L2ZFB.json","view_paper":"https://pith.science/paper/MKRKRDRZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.0790&json=true","fetch_graph":"https://pith.science/api/pith-number/MKRKRDRZCCWWGIHPVX643L2ZFB/graph.json","fetch_events":"https://pith.science/api/pith-number/MKRKRDRZCCWWGIHPVX643L2ZFB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MKRKRDRZCCWWGIHPVX643L2ZFB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MKRKRDRZCCWWGIHPVX643L2ZFB/action/storage_attestation","attest_author":"https://pith.science/pith/MKRKRDRZCCWWGIHPVX643L2ZFB/action/author_attestation","sign_citation":"https://pith.science/pith/MKRKRDRZCCWWGIHPVX643L2ZFB/action/citation_signature","submit_replication":"https://pith.science/pith/MKRKRDRZCCWWGIHPVX643L2ZFB/action/replication_record"}},"created_at":"2026-05-18T04:07:05.612661+00:00","updated_at":"2026-05-18T04:07:05.612661+00:00"}