{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:5SIZVS5FIQ3T7IX5ZBXLNOGIR6","short_pith_number":"pith:5SIZVS5F","schema_version":"1.0","canonical_sha256":"ec919acba544373fa2fdc86eb6b8c88f8f4c0728c9a9a0f52b8d1de21937353f","source":{"kind":"arxiv","id":"2007.11559","version":2},"attestation_state":"computed","paper":{"title":"An Improved Approximation Algorithm for the Matching Augmentation Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"J.Cheriyan, J.Dippel, J.Zhu, R.Cummings","submitted_at":"2020-07-22T17:28:02Z","abstract_excerpt":"We present a $\\frac53$-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  A $\\frac74$-approximation algorithm for the same problem was presented recently, see Cheriyan, et al., \"The matching augmentation problem: a $\\frac{7}{4}$-approximation algorithm,\" {\\em Math. Program.}, 182(1):315--354, 2020; arXiv:1810.07816.\n  Our improvement is based on new algorithmic techniques, and some of these may lead t"},"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":"2007.11559","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-07-22T17:28:02Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e9f528dac17d0994d0f20785587d9c7098c5c7a76fbec0d7cd919e058f42b814","abstract_canon_sha256":"91f7126b278c23b271e05d31b605b42863cdf3ccfbfc787385f408b72ad7c4ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:58:41.764894Z","signature_b64":"pVFipl0r8PyBNlSDWch1128yMFOfD4upHeavT0QrZ9E5FXdYpVdJhvFHu0Iu1+59TYTOySiaayWkdjrad7vOAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec919acba544373fa2fdc86eb6b8c88f8f4c0728c9a9a0f52b8d1de21937353f","last_reissued_at":"2026-07-05T01:58:41.764352Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:58:41.764352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Improved Approximation Algorithm for the Matching Augmentation Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"J.Cheriyan, J.Dippel, J.Zhu, R.Cummings","submitted_at":"2020-07-22T17:28:02Z","abstract_excerpt":"We present a $\\frac53$-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  A $\\frac74$-approximation algorithm for the same problem was presented recently, see Cheriyan, et al., \"The matching augmentation problem: a $\\frac{7}{4}$-approximation algorithm,\" {\\em Math. Program.}, 182(1):315--354, 2020; arXiv:1810.07816.\n  Our improvement is based on new algorithmic techniques, and some of these may lead t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.11559","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.11559/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2007.11559","created_at":"2026-07-05T01:58:41.764424+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.11559v2","created_at":"2026-07-05T01:58:41.764424+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.11559","created_at":"2026-07-05T01:58:41.764424+00:00"},{"alias_kind":"pith_short_12","alias_value":"5SIZVS5FIQ3T","created_at":"2026-07-05T01:58:41.764424+00:00"},{"alias_kind":"pith_short_16","alias_value":"5SIZVS5FIQ3T7IX5","created_at":"2026-07-05T01:58:41.764424+00:00"},{"alias_kind":"pith_short_8","alias_value":"5SIZVS5F","created_at":"2026-07-05T01:58:41.764424+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/5SIZVS5FIQ3T7IX5ZBXLNOGIR6","json":"https://pith.science/pith/5SIZVS5FIQ3T7IX5ZBXLNOGIR6.json","graph_json":"https://pith.science/api/pith-number/5SIZVS5FIQ3T7IX5ZBXLNOGIR6/graph.json","events_json":"https://pith.science/api/pith-number/5SIZVS5FIQ3T7IX5ZBXLNOGIR6/events.json","paper":"https://pith.science/paper/5SIZVS5F"},"agent_actions":{"view_html":"https://pith.science/pith/5SIZVS5FIQ3T7IX5ZBXLNOGIR6","download_json":"https://pith.science/pith/5SIZVS5FIQ3T7IX5ZBXLNOGIR6.json","view_paper":"https://pith.science/paper/5SIZVS5F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.11559&json=true","fetch_graph":"https://pith.science/api/pith-number/5SIZVS5FIQ3T7IX5ZBXLNOGIR6/graph.json","fetch_events":"https://pith.science/api/pith-number/5SIZVS5FIQ3T7IX5ZBXLNOGIR6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5SIZVS5FIQ3T7IX5ZBXLNOGIR6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5SIZVS5FIQ3T7IX5ZBXLNOGIR6/action/storage_attestation","attest_author":"https://pith.science/pith/5SIZVS5FIQ3T7IX5ZBXLNOGIR6/action/author_attestation","sign_citation":"https://pith.science/pith/5SIZVS5FIQ3T7IX5ZBXLNOGIR6/action/citation_signature","submit_replication":"https://pith.science/pith/5SIZVS5FIQ3T7IX5ZBXLNOGIR6/action/replication_record"}},"created_at":"2026-07-05T01:58:41.764424+00:00","updated_at":"2026-07-05T01:58:41.764424+00:00"}