{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:MDHXMPODYTSAVUYFCNND3SJJPW","short_pith_number":"pith:MDHXMPOD","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"},"canonical_sha256":"60cf763dc3c4e40ad305135a3dc9297d89dae6c4427bebaec4d60b97dac4e642","source":{"kind":"arxiv","id":"1104.3090","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.3090","created_at":"2026-05-18T02:22:02Z"},{"alias_kind":"arxiv_version","alias_value":"1104.3090v1","created_at":"2026-05-18T02:22:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3090","created_at":"2026-05-18T02:22:02Z"},{"alias_kind":"pith_short_12","alias_value":"MDHXMPODYTSA","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"MDHXMPODYTSAVUYF","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"MDHXMPOD","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:MDHXMPODYTSAVUYFCNND3SJJPW","target":"record","payload":{"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"},"canonical_sha256":"60cf763dc3c4e40ad305135a3dc9297d89dae6c4427bebaec4d60b97dac4e642","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"},"source_kind":"arxiv","source_id":"1104.3090","source_version":1,"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-18T02:22:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n0I49ihX4ytGQRAFUe0YyMHMZD4TYGFTker6Qau+rS4HY/80DPd5qHEQkCgkaSVuwlFYeR+yWPYhFADvXMZ6BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T19:45:46.258694Z"},"content_sha256":"c1f06963fc42f9b628305af0591e91c00c7163e34d83eda65fd58796c2b42461","schema_version":"1.0","event_id":"sha256:c1f06963fc42f9b628305af0591e91c00c7163e34d83eda65fd58796c2b42461"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:MDHXMPODYTSAVUYFCNND3SJJPW","target":"graph","payload":{"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"},"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-18T02:22:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3id7MLk7hkNIhZtTWGKkS4B579cyYl7e5xnKLNF9v+z3MS+X4U1XlKGknn8+Www2ODjVgJKJ/A8J3r2/IdJMCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T19:45:46.259115Z"},"content_sha256":"f6c7847142497a54a59d76abfda8857229c0fa65d39d5e6bd5d3dc5f73213f7d","schema_version":"1.0","event_id":"sha256:f6c7847142497a54a59d76abfda8857229c0fa65d39d5e6bd5d3dc5f73213f7d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MDHXMPODYTSAVUYFCNND3SJJPW/bundle.json","state_url":"https://pith.science/pith/MDHXMPODYTSAVUYFCNND3SJJPW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MDHXMPODYTSAVUYFCNND3SJJPW/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-24T19:45:46Z","links":{"resolver":"https://pith.science/pith/MDHXMPODYTSAVUYFCNND3SJJPW","bundle":"https://pith.science/pith/MDHXMPODYTSAVUYFCNND3SJJPW/bundle.json","state":"https://pith.science/pith/MDHXMPODYTSAVUYFCNND3SJJPW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MDHXMPODYTSAVUYFCNND3SJJPW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:MDHXMPODYTSAVUYFCNND3SJJPW","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":"714e9a9ae80f19d4fc7ff6348386e696e7af032ad54d0ed0781d3866f0228ed0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-15T15:40:56Z","title_canon_sha256":"62a5b2970b7265c52ad195f27d25c035a8818783649cc32eb96462e98761b0e7"},"schema_version":"1.0","source":{"id":"1104.3090","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.3090","created_at":"2026-05-18T02:22:02Z"},{"alias_kind":"arxiv_version","alias_value":"1104.3090v1","created_at":"2026-05-18T02:22:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3090","created_at":"2026-05-18T02:22:02Z"},{"alias_kind":"pith_short_12","alias_value":"MDHXMPODYTSA","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"MDHXMPODYTSAVUYF","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"MDHXMPOD","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:f6c7847142497a54a59d76abfda8857229c0fa65d39d5e6bd5d3dc5f73213f7d","target":"graph","created_at":"2026-05-18T02:22:02Z","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 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","authors_text":"Ola Svensson, Tobias M\\\"omke","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-15T15:40:56Z","title":"Approximating Graphic TSP by Matchings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3090","kind":"arxiv","version":1},"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:c1f06963fc42f9b628305af0591e91c00c7163e34d83eda65fd58796c2b42461","target":"record","created_at":"2026-05-18T02:22:02Z","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":"714e9a9ae80f19d4fc7ff6348386e696e7af032ad54d0ed0781d3866f0228ed0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-15T15:40:56Z","title_canon_sha256":"62a5b2970b7265c52ad195f27d25c035a8818783649cc32eb96462e98761b0e7"},"schema_version":"1.0","source":{"id":"1104.3090","kind":"arxiv","version":1}},"canonical_sha256":"60cf763dc3c4e40ad305135a3dc9297d89dae6c4427bebaec4d60b97dac4e642","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60cf763dc3c4e40ad305135a3dc9297d89dae6c4427bebaec4d60b97dac4e642","first_computed_at":"2026-05-18T02:22:02.886966Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:02.886966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZcARD1CY6s6wljpXvaL9w3smg3eE9vHPExOQfdlFElSvQbdKL2iRThSnEpExHTrDUUtRYcVB85yj8/WAaDSFAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:02.887653Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.3090","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c1f06963fc42f9b628305af0591e91c00c7163e34d83eda65fd58796c2b42461","sha256:f6c7847142497a54a59d76abfda8857229c0fa65d39d5e6bd5d3dc5f73213f7d"],"state_sha256":"34ae7910c2ed61390891212915b289f6db13e8f7d811f2c55d38754374068f5f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pk2ORfYaoAuUgrvvFDQsJsAWmYQdUQgkjrzdqZZFMBx+GO6mqSfk9HGy015PVENDLqMpO6lKkyHYTB/lOMvTDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T19:45:46.261987Z","bundle_sha256":"5bd4cbb9c7ef9c563c110da8681c65f2f31e927f5c8de75e4f7ae77e3916f052"}}