{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IIZWTGZJL65GGASWF3B66FW64J","short_pith_number":"pith:IIZWTGZJ","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"},"canonical_sha256":"4233699b295fba6302562ec3ef16dee27872ea91d20f1355578d13167afbba1a","source":{"kind":"arxiv","id":"1810.07816","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.07816","created_at":"2026-05-17T23:47:59Z"},{"alias_kind":"arxiv_version","alias_value":"1810.07816v2","created_at":"2026-05-17T23:47:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07816","created_at":"2026-05-17T23:47:59Z"},{"alias_kind":"pith_short_12","alias_value":"IIZWTGZJL65G","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IIZWTGZJL65GGASW","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IIZWTGZJ","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IIZWTGZJL65GGASWF3B66FW64J","target":"record","payload":{"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"},"canonical_sha256":"4233699b295fba6302562ec3ef16dee27872ea91d20f1355578d13167afbba1a","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"},"source_kind":"arxiv","source_id":"1810.07816","source_version":2,"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-17T23:47:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v6vKbJeLdOU/wYuc3oTSdnaSFQoWTUSYHwdVZsSStKjGOk0wvjLZP6yAoE+l5LVt4XB1ecYvMXnF8U9KfC9PAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T21:56:00.899388Z"},"content_sha256":"9640ea72b838e7fe7631e58a2f27f3f8c0afaf4347e0781cf7589173468dea80","schema_version":"1.0","event_id":"sha256:9640ea72b838e7fe7631e58a2f27f3f8c0afaf4347e0781cf7589173468dea80"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IIZWTGZJL65GGASWF3B66FW64J","target":"graph","payload":{"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"},"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-17T23:47:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1/zKai5AYnVoKsF9Gh4kjursdwgqCMlc7ACwv2jLnAr2iqTYd02pkw8WlbGPTEBdN6Akf+0OJthf3oU5f+yuBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T21:56:00.900135Z"},"content_sha256":"3f453d14555107afa1132b846963be772824b6cadaa6d0e7bf824919f2004762","schema_version":"1.0","event_id":"sha256:3f453d14555107afa1132b846963be772824b6cadaa6d0e7bf824919f2004762"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IIZWTGZJL65GGASWF3B66FW64J/bundle.json","state_url":"https://pith.science/pith/IIZWTGZJL65GGASWF3B66FW64J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IIZWTGZJL65GGASWF3B66FW64J/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-05-24T21:56:00Z","links":{"resolver":"https://pith.science/pith/IIZWTGZJL65GGASWF3B66FW64J","bundle":"https://pith.science/pith/IIZWTGZJL65GGASWF3B66FW64J/bundle.json","state":"https://pith.science/pith/IIZWTGZJL65GGASWF3B66FW64J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IIZWTGZJL65GGASWF3B66FW64J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IIZWTGZJL65GGASWF3B66FW64J","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":"6e25a119a9397efe706737274b634cff4765b27e0648a404cf9cd308ed2675ef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-17T21:55:38Z","title_canon_sha256":"2a14538274f697121b662fb4c49e2d7f8856c65d20ff4238e4850ad4991b2667"},"schema_version":"1.0","source":{"id":"1810.07816","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.07816","created_at":"2026-05-17T23:47:59Z"},{"alias_kind":"arxiv_version","alias_value":"1810.07816v2","created_at":"2026-05-17T23:47:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07816","created_at":"2026-05-17T23:47:59Z"},{"alias_kind":"pith_short_12","alias_value":"IIZWTGZJL65G","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IIZWTGZJL65GGASW","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IIZWTGZJ","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:3f453d14555107afa1132b846963be772824b6cadaa6d0e7bf824919f2004762","target":"graph","created_at":"2026-05-17T23:47:59Z","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 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","authors_text":"Arindam Khan, Fabrizio Grandoni, Jack Dippel, Joe Cheriyan, Vishnu V. Narayan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-17T21:55:38Z","title":"The Matching Augmentation Problem: A $\\frac74$-Approximation Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07816","kind":"arxiv","version":2},"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:9640ea72b838e7fe7631e58a2f27f3f8c0afaf4347e0781cf7589173468dea80","target":"record","created_at":"2026-05-17T23:47:59Z","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":"6e25a119a9397efe706737274b634cff4765b27e0648a404cf9cd308ed2675ef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-17T21:55:38Z","title_canon_sha256":"2a14538274f697121b662fb4c49e2d7f8856c65d20ff4238e4850ad4991b2667"},"schema_version":"1.0","source":{"id":"1810.07816","kind":"arxiv","version":2}},"canonical_sha256":"4233699b295fba6302562ec3ef16dee27872ea91d20f1355578d13167afbba1a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4233699b295fba6302562ec3ef16dee27872ea91d20f1355578d13167afbba1a","first_computed_at":"2026-05-17T23:47:59.361622Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:59.361622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"37PnXnMf7L7hAzlA7duinaPyqYE3xSIJaZ6QfkeIQ3Dga83JAhYhmbQMY/tdqOU898VTckEC/OqP++6WXxKRCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:59.362090Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.07816","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9640ea72b838e7fe7631e58a2f27f3f8c0afaf4347e0781cf7589173468dea80","sha256:3f453d14555107afa1132b846963be772824b6cadaa6d0e7bf824919f2004762"],"state_sha256":"7c21c7f2d374753229763467f20a225f519bef6c9c6f9f8acfa3204f0117ec1b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ah61eJ6qzq9zSdUjySSJRuAtVASoZCS6oYoHDwMdmuqqgFTE0veNV2ynks+y6AnX2cKGC5qOXt6Y1UNVnl06Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T21:56:00.903602Z","bundle_sha256":"8defe76ad104079303d12d1458f94d6b8bee73a0cf95fab4dc34552798839914"}}