{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:MDHXMPODYTSAVUYFCNND3SJJPW","short_pith_number":"pith:MDHXMPOD","schema_version":"1.0","canonical_sha256":"60cf763dc3c4e40ad305135a3dc9297d89dae6c4427bebaec4d60b97dac4e642","source":{"kind":"arxiv","id":"1104.3090","version":1},"attestation_state":"computed","paper":{"title":"Approximating Graphic TSP by Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ola Svensson, Tobias M\\\"omke","submitted_at":"2011-04-15T15:40:56Z","abstract_excerpt":"We present a framework for approximating the metric TSP based on a novel use of matchings. Traditionally, matchings have been used to add edges in order to make a given graph Eulerian, whereas our approach also allows for the removal of certain edges leading to a decreased cost.\n  For the TSP on graphic metrics (graph-TSP), the approach yields a 1.461-approximation algorithm with respect to the Held-Karp lower bound. For graph-TSP restricted to a class of graphs that contains degree three bounded and claw-free graphs, we show that the integrality gap of the Held-Karp relaxation matches the con"},"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":"1104.3090","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-15T15:40:56Z","cross_cats_sorted":[],"title_canon_sha256":"62a5b2970b7265c52ad195f27d25c035a8818783649cc32eb96462e98761b0e7","abstract_canon_sha256":"714e9a9ae80f19d4fc7ff6348386e696e7af032ad54d0ed0781d3866f0228ed0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:02.887653Z","signature_b64":"ZcARD1CY6s6wljpXvaL9w3smg3eE9vHPExOQfdlFElSvQbdKL2iRThSnEpExHTrDUUtRYcVB85yj8/WAaDSFAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60cf763dc3c4e40ad305135a3dc9297d89dae6c4427bebaec4d60b97dac4e642","last_reissued_at":"2026-05-18T02:22:02.886966Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:02.886966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating Graphic TSP by Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ola Svensson, Tobias M\\\"omke","submitted_at":"2011-04-15T15:40:56Z","abstract_excerpt":"We present a framework for approximating the metric TSP based on a novel use of matchings. Traditionally, matchings have been used to add edges in order to make a given graph Eulerian, whereas our approach also allows for the removal of certain edges leading to a decreased cost.\n  For the TSP on graphic metrics (graph-TSP), the approach yields a 1.461-approximation algorithm with respect to the Held-Karp lower bound. For graph-TSP restricted to a class of graphs that contains degree three bounded and claw-free graphs, we show that the integrality gap of the Held-Karp relaxation matches the con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3090","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":""},"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":"1104.3090","created_at":"2026-05-18T02:22:02.887066+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.3090v1","created_at":"2026-05-18T02:22:02.887066+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3090","created_at":"2026-05-18T02:22:02.887066+00:00"},{"alias_kind":"pith_short_12","alias_value":"MDHXMPODYTSA","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"MDHXMPODYTSAVUYF","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"MDHXMPOD","created_at":"2026-05-18T12:26:34.985390+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/MDHXMPODYTSAVUYFCNND3SJJPW","json":"https://pith.science/pith/MDHXMPODYTSAVUYFCNND3SJJPW.json","graph_json":"https://pith.science/api/pith-number/MDHXMPODYTSAVUYFCNND3SJJPW/graph.json","events_json":"https://pith.science/api/pith-number/MDHXMPODYTSAVUYFCNND3SJJPW/events.json","paper":"https://pith.science/paper/MDHXMPOD"},"agent_actions":{"view_html":"https://pith.science/pith/MDHXMPODYTSAVUYFCNND3SJJPW","download_json":"https://pith.science/pith/MDHXMPODYTSAVUYFCNND3SJJPW.json","view_paper":"https://pith.science/paper/MDHXMPOD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.3090&json=true","fetch_graph":"https://pith.science/api/pith-number/MDHXMPODYTSAVUYFCNND3SJJPW/graph.json","fetch_events":"https://pith.science/api/pith-number/MDHXMPODYTSAVUYFCNND3SJJPW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MDHXMPODYTSAVUYFCNND3SJJPW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MDHXMPODYTSAVUYFCNND3SJJPW/action/storage_attestation","attest_author":"https://pith.science/pith/MDHXMPODYTSAVUYFCNND3SJJPW/action/author_attestation","sign_citation":"https://pith.science/pith/MDHXMPODYTSAVUYFCNND3SJJPW/action/citation_signature","submit_replication":"https://pith.science/pith/MDHXMPODYTSAVUYFCNND3SJJPW/action/replication_record"}},"created_at":"2026-05-18T02:22:02.887066+00:00","updated_at":"2026-05-18T02:22:02.887066+00:00"}