{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:5SIZVS5FIQ3T7IX5ZBXLNOGIR6","short_pith_number":"pith:5SIZVS5F","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"},"canonical_sha256":"ec919acba544373fa2fdc86eb6b8c88f8f4c0728c9a9a0f52b8d1de21937353f","source":{"kind":"arxiv","id":"2007.11559","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.11559","created_at":"2026-07-05T01:58:41Z"},{"alias_kind":"arxiv_version","alias_value":"2007.11559v2","created_at":"2026-07-05T01:58:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.11559","created_at":"2026-07-05T01:58:41Z"},{"alias_kind":"pith_short_12","alias_value":"5SIZVS5FIQ3T","created_at":"2026-07-05T01:58:41Z"},{"alias_kind":"pith_short_16","alias_value":"5SIZVS5FIQ3T7IX5","created_at":"2026-07-05T01:58:41Z"},{"alias_kind":"pith_short_8","alias_value":"5SIZVS5F","created_at":"2026-07-05T01:58:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:5SIZVS5FIQ3T7IX5ZBXLNOGIR6","target":"record","payload":{"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"},"canonical_sha256":"ec919acba544373fa2fdc86eb6b8c88f8f4c0728c9a9a0f52b8d1de21937353f","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"},"source_kind":"arxiv","source_id":"2007.11559","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-07-05T01:58:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gyzKlyMaeHYhofAIHl3EC6CYzGLtmhfi6bh2sA1g0g+VPU4wt56bXyFC5r3iwnSOwAYIngqQv3TipKb1I/SqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T16:54:12.144942Z"},"content_sha256":"80427baab2cb8aee94aa6f4e59f08722f9b8adb2f98ad4860e7a84c7523a9032","schema_version":"1.0","event_id":"sha256:80427baab2cb8aee94aa6f4e59f08722f9b8adb2f98ad4860e7a84c7523a9032"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:5SIZVS5FIQ3T7IX5ZBXLNOGIR6","target":"graph","payload":{"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"},"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-07-05T01:58:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bE3HD2+vkqHT0WxX1pHYIsIo0i1BHTGDTzFJb7CAfA/eKzu5LuHfk0QW/ebTm5pYNKK05P5lx2cbtr/4YBTCDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T16:54:12.145348Z"},"content_sha256":"fbd1cda8fb66b14bca824dd98502eb4fb1d83e8e3fb26cc120b4e2e53c4d7657","schema_version":"1.0","event_id":"sha256:fbd1cda8fb66b14bca824dd98502eb4fb1d83e8e3fb26cc120b4e2e53c4d7657"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5SIZVS5FIQ3T7IX5ZBXLNOGIR6/bundle.json","state_url":"https://pith.science/pith/5SIZVS5FIQ3T7IX5ZBXLNOGIR6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5SIZVS5FIQ3T7IX5ZBXLNOGIR6/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-08-03T16:54:12Z","links":{"resolver":"https://pith.science/pith/5SIZVS5FIQ3T7IX5ZBXLNOGIR6","bundle":"https://pith.science/pith/5SIZVS5FIQ3T7IX5ZBXLNOGIR6/bundle.json","state":"https://pith.science/pith/5SIZVS5FIQ3T7IX5ZBXLNOGIR6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5SIZVS5FIQ3T7IX5ZBXLNOGIR6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:5SIZVS5FIQ3T7IX5ZBXLNOGIR6","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":"91f7126b278c23b271e05d31b605b42863cdf3ccfbfc787385f408b72ad7c4ba","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-07-22T17:28:02Z","title_canon_sha256":"e9f528dac17d0994d0f20785587d9c7098c5c7a76fbec0d7cd919e058f42b814"},"schema_version":"1.0","source":{"id":"2007.11559","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.11559","created_at":"2026-07-05T01:58:41Z"},{"alias_kind":"arxiv_version","alias_value":"2007.11559v2","created_at":"2026-07-05T01:58:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.11559","created_at":"2026-07-05T01:58:41Z"},{"alias_kind":"pith_short_12","alias_value":"5SIZVS5FIQ3T","created_at":"2026-07-05T01:58:41Z"},{"alias_kind":"pith_short_16","alias_value":"5SIZVS5FIQ3T7IX5","created_at":"2026-07-05T01:58:41Z"},{"alias_kind":"pith_short_8","alias_value":"5SIZVS5F","created_at":"2026-07-05T01:58:41Z"}],"graph_snapshots":[{"event_id":"sha256:fbd1cda8fb66b14bca824dd98502eb4fb1d83e8e3fb26cc120b4e2e53c4d7657","target":"graph","created_at":"2026-07-05T01:58:41Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2007.11559/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"J.Cheriyan, J.Dippel, J.Zhu, R.Cummings","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-07-22T17:28:02Z","title":"An Improved Approximation Algorithm for the Matching Augmentation Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.11559","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:80427baab2cb8aee94aa6f4e59f08722f9b8adb2f98ad4860e7a84c7523a9032","target":"record","created_at":"2026-07-05T01:58:41Z","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":"91f7126b278c23b271e05d31b605b42863cdf3ccfbfc787385f408b72ad7c4ba","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-07-22T17:28:02Z","title_canon_sha256":"e9f528dac17d0994d0f20785587d9c7098c5c7a76fbec0d7cd919e058f42b814"},"schema_version":"1.0","source":{"id":"2007.11559","kind":"arxiv","version":2}},"canonical_sha256":"ec919acba544373fa2fdc86eb6b8c88f8f4c0728c9a9a0f52b8d1de21937353f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec919acba544373fa2fdc86eb6b8c88f8f4c0728c9a9a0f52b8d1de21937353f","first_computed_at":"2026-07-05T01:58:41.764352Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:58:41.764352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pVFipl0r8PyBNlSDWch1128yMFOfD4upHeavT0QrZ9E5FXdYpVdJhvFHu0Iu1+59TYTOySiaayWkdjrad7vOAw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:58:41.764894Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.11559","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80427baab2cb8aee94aa6f4e59f08722f9b8adb2f98ad4860e7a84c7523a9032","sha256:fbd1cda8fb66b14bca824dd98502eb4fb1d83e8e3fb26cc120b4e2e53c4d7657"],"state_sha256":"e0e396bb7032a69494073d03afffd2cc18ed30caa2799867dbd6e6a250df23a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7s7haUXkv3xkhzruiUP49p48QUyF91krdDZ6hnXcTRthSRKrBzFcQRlwojA+mfvxlPiKU9wjTesfVdgGhip9Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T16:54:12.148341Z","bundle_sha256":"99f92a2e0fbbf09307c3c1f5d2b173857aac9bd8cb2704dbf0dc34a8c690af54"}}