{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HQ6YTOZWSB2IXG3B5XYU7XG2ZV","short_pith_number":"pith:HQ6YTOZW","schema_version":"1.0","canonical_sha256":"3c3d89bb3690748b9b61edf14fdcdacd53993fd726ad171cda1d5b5777533f99","source":{"kind":"arxiv","id":"1811.08506","version":1},"attestation_state":"computed","paper":{"title":"Tight Approximation Ratio for Minimum Maximal Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Jan Marcinkowski (University of Wroc{\\l}aw, Mateusz Lewandowski, Poland), Szymon Dudycz","submitted_at":"2018-11-20T22:04:59Z","abstract_excerpt":"We study a combinatorial problem called Minimum Maximal Matching, where we are asked to find in a general graph the smallest that can not be extended. We show that this problem is hard to approximate with a constant smaller than 2, assuming the Unique Games Conjecture.\n  As a corollary we show, that Minimum Maximal Matching in bipartite graphs is hard to approximate with constant smaller than $\\frac{4}{3}$, with the same assumption. With a stronger variant of the Unique Games Conjecture --- that is Small Set Expansion Hypothesis --- we are able to improve the hardness result up to the factor o"},"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":"1811.08506","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-11-20T22:04:59Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"98643544af9e30cc32523fda65f9dfcfc5598838c179c234066277ebfa6bebb3","abstract_canon_sha256":"3830bfb101c8942425d8442234c50914c12172c2a2d3e93c09285073fcc649e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:12.341178Z","signature_b64":"xujTnMv4iz4+AO3EJNe2PYT6/KHdj1BUYQo18Cepxl7RP7qiw1yt7x0hK1ic6gI5JWWFaZowM7noOzMvt+yDBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c3d89bb3690748b9b61edf14fdcdacd53993fd726ad171cda1d5b5777533f99","last_reissued_at":"2026-05-18T00:00:12.340505Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:12.340505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Approximation Ratio for Minimum Maximal Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Jan Marcinkowski (University of Wroc{\\l}aw, Mateusz Lewandowski, Poland), Szymon Dudycz","submitted_at":"2018-11-20T22:04:59Z","abstract_excerpt":"We study a combinatorial problem called Minimum Maximal Matching, where we are asked to find in a general graph the smallest that can not be extended. We show that this problem is hard to approximate with a constant smaller than 2, assuming the Unique Games Conjecture.\n  As a corollary we show, that Minimum Maximal Matching in bipartite graphs is hard to approximate with constant smaller than $\\frac{4}{3}$, with the same assumption. With a stronger variant of the Unique Games Conjecture --- that is Small Set Expansion Hypothesis --- we are able to improve the hardness result up to the factor o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08506","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":"1811.08506","created_at":"2026-05-18T00:00:12.340621+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.08506v1","created_at":"2026-05-18T00:00:12.340621+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08506","created_at":"2026-05-18T00:00:12.340621+00:00"},{"alias_kind":"pith_short_12","alias_value":"HQ6YTOZWSB2I","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HQ6YTOZWSB2IXG3B","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HQ6YTOZW","created_at":"2026-05-18T12:32:28.185984+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/HQ6YTOZWSB2IXG3B5XYU7XG2ZV","json":"https://pith.science/pith/HQ6YTOZWSB2IXG3B5XYU7XG2ZV.json","graph_json":"https://pith.science/api/pith-number/HQ6YTOZWSB2IXG3B5XYU7XG2ZV/graph.json","events_json":"https://pith.science/api/pith-number/HQ6YTOZWSB2IXG3B5XYU7XG2ZV/events.json","paper":"https://pith.science/paper/HQ6YTOZW"},"agent_actions":{"view_html":"https://pith.science/pith/HQ6YTOZWSB2IXG3B5XYU7XG2ZV","download_json":"https://pith.science/pith/HQ6YTOZWSB2IXG3B5XYU7XG2ZV.json","view_paper":"https://pith.science/paper/HQ6YTOZW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.08506&json=true","fetch_graph":"https://pith.science/api/pith-number/HQ6YTOZWSB2IXG3B5XYU7XG2ZV/graph.json","fetch_events":"https://pith.science/api/pith-number/HQ6YTOZWSB2IXG3B5XYU7XG2ZV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HQ6YTOZWSB2IXG3B5XYU7XG2ZV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HQ6YTOZWSB2IXG3B5XYU7XG2ZV/action/storage_attestation","attest_author":"https://pith.science/pith/HQ6YTOZWSB2IXG3B5XYU7XG2ZV/action/author_attestation","sign_citation":"https://pith.science/pith/HQ6YTOZWSB2IXG3B5XYU7XG2ZV/action/citation_signature","submit_replication":"https://pith.science/pith/HQ6YTOZWSB2IXG3B5XYU7XG2ZV/action/replication_record"}},"created_at":"2026-05-18T00:00:12.340621+00:00","updated_at":"2026-05-18T00:00:12.340621+00:00"}