{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:M65BXSBBETR4KMVHYIWAN6D2KW","short_pith_number":"pith:M65BXSBB","schema_version":"1.0","canonical_sha256":"67ba1bc82124e3c532a7c22c06f87a558d9a2c3fe3de2ab5cc6652db40c9a2cb","source":{"kind":"arxiv","id":"1512.08070","version":2},"attestation_state":"computed","paper":{"title":"Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Philippe Legault, Sylvia Boyd","submitted_at":"2015-12-26T04:12:11Z","abstract_excerpt":"Given a complete graph $K_{n}=(V, E)$ with non-negative edge costs $c\\in {\\mathbb R}^{E}$, the problem $2EC$ is that of finding a 2-edge connected spanning multi-subgraph of $K_{n}$ of minimum cost. The integrality gap $\\alpha\\text{2EC}$ of the linear programming relaxation $\\text{2EC}^{\\text{LP}}$ for $2EC$ has been conjectured to be $\\frac{6}{5}$, although currently we only know that $\\frac{6}{5}\\leq\\alpha\\text{2EC}\\leq\\frac{3}{2}$. In this paper, we explore the idea of using the structure of solutions for $\\text{2EC}^{\\text{LP}}$ and the concept of convex combination to obtain improved boun"},"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":"1512.08070","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-12-26T04:12:11Z","cross_cats_sorted":[],"title_canon_sha256":"ef61d3dde7409870812f3e41bdbc4cf7a108cdec90c953b3cd4f07003ad15245","abstract_canon_sha256":"5f36ee8be6b466f91651ba629594a79d2431030a165e42a80d4a46d38e430731"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:36.653069Z","signature_b64":"DJgkagga0KP9QkDKRqqqQUrI1FxsclcsXQpi++q3KNTMd9QecETwe9q+Rt/mDjfoGmwugDs8IFIiIRyXB7xGDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67ba1bc82124e3c532a7c22c06f87a558d9a2c3fe3de2ab5cc6652db40c9a2cb","last_reissued_at":"2026-05-18T01:21:36.652548Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:36.652548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Philippe Legault, Sylvia Boyd","submitted_at":"2015-12-26T04:12:11Z","abstract_excerpt":"Given a complete graph $K_{n}=(V, E)$ with non-negative edge costs $c\\in {\\mathbb R}^{E}$, the problem $2EC$ is that of finding a 2-edge connected spanning multi-subgraph of $K_{n}$ of minimum cost. The integrality gap $\\alpha\\text{2EC}$ of the linear programming relaxation $\\text{2EC}^{\\text{LP}}$ for $2EC$ has been conjectured to be $\\frac{6}{5}$, although currently we only know that $\\frac{6}{5}\\leq\\alpha\\text{2EC}\\leq\\frac{3}{2}$. In this paper, we explore the idea of using the structure of solutions for $\\text{2EC}^{\\text{LP}}$ and the concept of convex combination to obtain improved boun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.08070","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":"1512.08070","created_at":"2026-05-18T01:21:36.652630+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.08070v2","created_at":"2026-05-18T01:21:36.652630+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.08070","created_at":"2026-05-18T01:21:36.652630+00:00"},{"alias_kind":"pith_short_12","alias_value":"M65BXSBBETR4","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"M65BXSBBETR4KMVH","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"M65BXSBB","created_at":"2026-05-18T12:29:32.376354+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/M65BXSBBETR4KMVHYIWAN6D2KW","json":"https://pith.science/pith/M65BXSBBETR4KMVHYIWAN6D2KW.json","graph_json":"https://pith.science/api/pith-number/M65BXSBBETR4KMVHYIWAN6D2KW/graph.json","events_json":"https://pith.science/api/pith-number/M65BXSBBETR4KMVHYIWAN6D2KW/events.json","paper":"https://pith.science/paper/M65BXSBB"},"agent_actions":{"view_html":"https://pith.science/pith/M65BXSBBETR4KMVHYIWAN6D2KW","download_json":"https://pith.science/pith/M65BXSBBETR4KMVHYIWAN6D2KW.json","view_paper":"https://pith.science/paper/M65BXSBB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.08070&json=true","fetch_graph":"https://pith.science/api/pith-number/M65BXSBBETR4KMVHYIWAN6D2KW/graph.json","fetch_events":"https://pith.science/api/pith-number/M65BXSBBETR4KMVHYIWAN6D2KW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M65BXSBBETR4KMVHYIWAN6D2KW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M65BXSBBETR4KMVHYIWAN6D2KW/action/storage_attestation","attest_author":"https://pith.science/pith/M65BXSBBETR4KMVHYIWAN6D2KW/action/author_attestation","sign_citation":"https://pith.science/pith/M65BXSBBETR4KMVHYIWAN6D2KW/action/citation_signature","submit_replication":"https://pith.science/pith/M65BXSBBETR4KMVHYIWAN6D2KW/action/replication_record"}},"created_at":"2026-05-18T01:21:36.652630+00:00","updated_at":"2026-05-18T01:21:36.652630+00:00"}