{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:VJHVNFQXM4LSPL75RGCYKD75VA","short_pith_number":"pith:VJHVNFQX","schema_version":"1.0","canonical_sha256":"aa4f569617671727affd8985850ffda8018e776d25170408c55e4638fb23b261","source":{"kind":"arxiv","id":"2008.03327","version":1},"attestation_state":"computed","paper":{"title":"A $4/3$-Approximation Algorithm for the Minimum $2$-Edge Connected Multisubgraph Problem in the Half-Integral Case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"J.Cheriyan, L.Grout, L.Wang, R.Cummings, S.Boyd, S.Ibrahimpur, Z.Szigeti","submitted_at":"2020-08-07T18:20:39Z","abstract_excerpt":"Given a connected undirected graph $\\bar{G}$ on $n$ vertices, and non-negative edge costs $c$, the 2ECM problem is that of finding a $2$-edge~connected spanning multisubgraph of $\\bar{G}$ of minimum cost. The natural linear program (LP) for 2ECM, which coincides with the subtour LP for the Traveling Salesman Problem on the metric closure of $\\bar{G}$, gives a lower bound on the optimal cost. For instances where this LP is optimized by a half-integral solution $x$, Carr and Ravi (1998) showed that the integrality gap is at most $\\frac43$: they show that the vector $\\frac43 x$ dominates a convex"},"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":"2008.03327","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-08-07T18:20:39Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"dd22700032d8045c66d23319ee60c9784155529cc27d50036d7f355536d0fce0","abstract_canon_sha256":"3894247bb2c970b87ec501d1b0ed91d6d2f5fd15980b49e72b25ad70fde44ab2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:25:40.619991Z","signature_b64":"BjpCbFEJ82vH3FHR5KNPZQX7qZsjLwW8GDHjQ04WXGkNioKtgDTduNiJ2yHKuEYOd1Sup7bBT8Uxy2OO/GI7Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa4f569617671727affd8985850ffda8018e776d25170408c55e4638fb23b261","last_reissued_at":"2026-07-05T01:25:40.619483Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:25:40.619483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A $4/3$-Approximation Algorithm for the Minimum $2$-Edge Connected Multisubgraph Problem in the Half-Integral Case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"J.Cheriyan, L.Grout, L.Wang, R.Cummings, S.Boyd, S.Ibrahimpur, Z.Szigeti","submitted_at":"2020-08-07T18:20:39Z","abstract_excerpt":"Given a connected undirected graph $\\bar{G}$ on $n$ vertices, and non-negative edge costs $c$, the 2ECM problem is that of finding a $2$-edge~connected spanning multisubgraph of $\\bar{G}$ of minimum cost. The natural linear program (LP) for 2ECM, which coincides with the subtour LP for the Traveling Salesman Problem on the metric closure of $\\bar{G}$, gives a lower bound on the optimal cost. For instances where this LP is optimized by a half-integral solution $x$, Carr and Ravi (1998) showed that the integrality gap is at most $\\frac43$: they show that the vector $\\frac43 x$ dominates a convex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.03327","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2008.03327/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":"2008.03327","created_at":"2026-07-05T01:25:40.619546+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.03327v1","created_at":"2026-07-05T01:25:40.619546+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.03327","created_at":"2026-07-05T01:25:40.619546+00:00"},{"alias_kind":"pith_short_12","alias_value":"VJHVNFQXM4LS","created_at":"2026-07-05T01:25:40.619546+00:00"},{"alias_kind":"pith_short_16","alias_value":"VJHVNFQXM4LSPL75","created_at":"2026-07-05T01:25:40.619546+00:00"},{"alias_kind":"pith_short_8","alias_value":"VJHVNFQX","created_at":"2026-07-05T01:25:40.619546+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/VJHVNFQXM4LSPL75RGCYKD75VA","json":"https://pith.science/pith/VJHVNFQXM4LSPL75RGCYKD75VA.json","graph_json":"https://pith.science/api/pith-number/VJHVNFQXM4LSPL75RGCYKD75VA/graph.json","events_json":"https://pith.science/api/pith-number/VJHVNFQXM4LSPL75RGCYKD75VA/events.json","paper":"https://pith.science/paper/VJHVNFQX"},"agent_actions":{"view_html":"https://pith.science/pith/VJHVNFQXM4LSPL75RGCYKD75VA","download_json":"https://pith.science/pith/VJHVNFQXM4LSPL75RGCYKD75VA.json","view_paper":"https://pith.science/paper/VJHVNFQX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.03327&json=true","fetch_graph":"https://pith.science/api/pith-number/VJHVNFQXM4LSPL75RGCYKD75VA/graph.json","fetch_events":"https://pith.science/api/pith-number/VJHVNFQXM4LSPL75RGCYKD75VA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VJHVNFQXM4LSPL75RGCYKD75VA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VJHVNFQXM4LSPL75RGCYKD75VA/action/storage_attestation","attest_author":"https://pith.science/pith/VJHVNFQXM4LSPL75RGCYKD75VA/action/author_attestation","sign_citation":"https://pith.science/pith/VJHVNFQXM4LSPL75RGCYKD75VA/action/citation_signature","submit_replication":"https://pith.science/pith/VJHVNFQXM4LSPL75RGCYKD75VA/action/replication_record"}},"created_at":"2026-07-05T01:25:40.619546+00:00","updated_at":"2026-07-05T01:25:40.619546+00:00"}