{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IIZWTGZJL65GGASWF3B66FW64J","short_pith_number":"pith:IIZWTGZJ","schema_version":"1.0","canonical_sha256":"4233699b295fba6302562ec3ef16dee27872ea91d20f1355578d13167afbba1a","source":{"kind":"arxiv","id":"1810.07816","version":2},"attestation_state":"computed","paper":{"title":"The Matching Augmentation Problem: A $\\frac74$-Approximation Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arindam Khan, Fabrizio Grandoni, Jack Dippel, Joe Cheriyan, Vishnu V. Narayan","submitted_at":"2018-10-17T21:55:38Z","abstract_excerpt":"We present a $\\frac74$ approximation algorithm for the matching augmentation problem (MAP): given a multi-graph with edges of cost either zero or one such that the edges of cost zero form a matching, find a 2-edge connected spanning subgraph (2-ECSS) of minimum cost.\n  We first present a reduction of any given MAP instance to a collection of well-structured MAP instances such that the approximation guarantee is preserved. Then we present a $\\frac74$ approximation algorithm for a well-structured MAP instance. The algorithm starts with a min-cost 2-edge cover and then applies ear-augmentation st"},"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":"1810.07816","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-17T21:55:38Z","cross_cats_sorted":[],"title_canon_sha256":"2a14538274f697121b662fb4c49e2d7f8856c65d20ff4238e4850ad4991b2667","abstract_canon_sha256":"6e25a119a9397efe706737274b634cff4765b27e0648a404cf9cd308ed2675ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:59.362090Z","signature_b64":"37PnXnMf7L7hAzlA7duinaPyqYE3xSIJaZ6QfkeIQ3Dga83JAhYhmbQMY/tdqOU898VTckEC/OqP++6WXxKRCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4233699b295fba6302562ec3ef16dee27872ea91d20f1355578d13167afbba1a","last_reissued_at":"2026-05-17T23:47:59.361622Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:59.361622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Matching Augmentation Problem: A $\\frac74$-Approximation Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arindam Khan, Fabrizio Grandoni, Jack Dippel, Joe Cheriyan, Vishnu V. Narayan","submitted_at":"2018-10-17T21:55:38Z","abstract_excerpt":"We present a $\\frac74$ approximation algorithm for the matching augmentation problem (MAP): given a multi-graph with edges of cost either zero or one such that the edges of cost zero form a matching, find a 2-edge connected spanning subgraph (2-ECSS) of minimum cost.\n  We first present a reduction of any given MAP instance to a collection of well-structured MAP instances such that the approximation guarantee is preserved. Then we present a $\\frac74$ approximation algorithm for a well-structured MAP instance. The algorithm starts with a min-cost 2-edge cover and then applies ear-augmentation st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07816","kind":"arxiv","version":2},"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":"1810.07816","created_at":"2026-05-17T23:47:59.361690+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.07816v2","created_at":"2026-05-17T23:47:59.361690+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07816","created_at":"2026-05-17T23:47:59.361690+00:00"},{"alias_kind":"pith_short_12","alias_value":"IIZWTGZJL65G","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"IIZWTGZJL65GGASW","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"IIZWTGZJ","created_at":"2026-05-18T12:32:31.084164+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/IIZWTGZJL65GGASWF3B66FW64J","json":"https://pith.science/pith/IIZWTGZJL65GGASWF3B66FW64J.json","graph_json":"https://pith.science/api/pith-number/IIZWTGZJL65GGASWF3B66FW64J/graph.json","events_json":"https://pith.science/api/pith-number/IIZWTGZJL65GGASWF3B66FW64J/events.json","paper":"https://pith.science/paper/IIZWTGZJ"},"agent_actions":{"view_html":"https://pith.science/pith/IIZWTGZJL65GGASWF3B66FW64J","download_json":"https://pith.science/pith/IIZWTGZJL65GGASWF3B66FW64J.json","view_paper":"https://pith.science/paper/IIZWTGZJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.07816&json=true","fetch_graph":"https://pith.science/api/pith-number/IIZWTGZJL65GGASWF3B66FW64J/graph.json","fetch_events":"https://pith.science/api/pith-number/IIZWTGZJL65GGASWF3B66FW64J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IIZWTGZJL65GGASWF3B66FW64J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IIZWTGZJL65GGASWF3B66FW64J/action/storage_attestation","attest_author":"https://pith.science/pith/IIZWTGZJL65GGASWF3B66FW64J/action/author_attestation","sign_citation":"https://pith.science/pith/IIZWTGZJL65GGASWF3B66FW64J/action/citation_signature","submit_replication":"https://pith.science/pith/IIZWTGZJL65GGASWF3B66FW64J/action/replication_record"}},"created_at":"2026-05-17T23:47:59.361690+00:00","updated_at":"2026-05-17T23:47:59.361690+00:00"}