{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:GUK6W2VFPO2FO2YOBIKNDBBBYY","short_pith_number":"pith:GUK6W2VF","canonical_record":{"source":{"id":"1412.6755","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-21T10:05:22Z","cross_cats_sorted":[],"title_canon_sha256":"8deacae76aead62a3fdee7eb30c9b40e4b35b9e2e9dd986afa88c7030578f63f","abstract_canon_sha256":"e38beaeda68c9047cc9f2c240bb1445cad3cd9878e81847361ce7dc7d3b2bced"},"schema_version":"1.0"},"canonical_sha256":"3515eb6aa57bb4576b0e0a14d18421c603941df74cd5a4e8edd85a804df6d2dc","source":{"kind":"arxiv","id":"1412.6755","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.6755","created_at":"2026-05-18T02:30:46Z"},{"alias_kind":"arxiv_version","alias_value":"1412.6755v1","created_at":"2026-05-18T02:30:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6755","created_at":"2026-05-18T02:30:46Z"},{"alias_kind":"pith_short_12","alias_value":"GUK6W2VFPO2F","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GUK6W2VFPO2FO2YO","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GUK6W2VF","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:GUK6W2VFPO2FO2YOBIKNDBBBYY","target":"record","payload":{"canonical_record":{"source":{"id":"1412.6755","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-21T10:05:22Z","cross_cats_sorted":[],"title_canon_sha256":"8deacae76aead62a3fdee7eb30c9b40e4b35b9e2e9dd986afa88c7030578f63f","abstract_canon_sha256":"e38beaeda68c9047cc9f2c240bb1445cad3cd9878e81847361ce7dc7d3b2bced"},"schema_version":"1.0"},"canonical_sha256":"3515eb6aa57bb4576b0e0a14d18421c603941df74cd5a4e8edd85a804df6d2dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:46.293711Z","signature_b64":"ueB+NqtB2PfcTk+WqwemJUi6ExjOa+I7Ee6EbwyV/Tsvszbx0xmUSy3NO6KsgGvKyt6/JuJVINllGYBTT1aEDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3515eb6aa57bb4576b0e0a14d18421c603941df74cd5a4e8edd85a804df6d2dc","last_reissued_at":"2026-05-18T02:30:46.293307Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:46.293307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.6755","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:30:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QgX7Vc784iTf5bdfcuwUJZ7Bf9S3c83jHK1Z63+NHxE0GaROMvszyMHNYcn7qPbSmquRtpd++GmOU/Cfc1UXAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T00:43:24.143477Z"},"content_sha256":"038c86d45cec93bb04d857b5a2b338416649a0d790a49f7204ae306439e16ac9","schema_version":"1.0","event_id":"sha256:038c86d45cec93bb04d857b5a2b338416649a0d790a49f7204ae306439e16ac9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:GUK6W2VFPO2FO2YOBIKNDBBBYY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Improved Approximation Algorithm for the Traveling Salesman Problem with Relaxed Triangle Inequality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Tobias M\\\"omke","submitted_at":"2014-12-21T10:05:22Z","abstract_excerpt":"Given a complete edge-weighted graph G, we present a polynomial time algorithm to compute a degree-four-bounded spanning Eulerian subgraph of 2G that has at most 1.5 times the weight of an optimal TSP solution of G. Based on this algorithm and a novel use of orientations in graphs, we obtain a (3 beta/4 + 3 beta^2/4)-approximation algorithm for TSP with beta-relaxed triangle inequality (beta-TSP), where beta >= 1. A graph G is an instance of beta-TSP, if it is a complete graph with non-negative edge weights that are restricted as follows. For each triple of vertices u,v,w in V(G), c({u,v}) <= "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6755","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:30:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WATX24ZM9AR2Dmkhip3oUWKx3Mre40VxvFiGFUTpLi0BPShKKncjjc3Pa4nfhTwc10rKcZ/lLfg0KhayLWIDBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T00:43:24.143864Z"},"content_sha256":"c83540ad7c263a727dc9be51bd09e1de6c1e95e2e9426bb0c61561eeda0ffbe8","schema_version":"1.0","event_id":"sha256:c83540ad7c263a727dc9be51bd09e1de6c1e95e2e9426bb0c61561eeda0ffbe8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GUK6W2VFPO2FO2YOBIKNDBBBYY/bundle.json","state_url":"https://pith.science/pith/GUK6W2VFPO2FO2YOBIKNDBBBYY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GUK6W2VFPO2FO2YOBIKNDBBBYY/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-24T00:43:24Z","links":{"resolver":"https://pith.science/pith/GUK6W2VFPO2FO2YOBIKNDBBBYY","bundle":"https://pith.science/pith/GUK6W2VFPO2FO2YOBIKNDBBBYY/bundle.json","state":"https://pith.science/pith/GUK6W2VFPO2FO2YOBIKNDBBBYY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GUK6W2VFPO2FO2YOBIKNDBBBYY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:GUK6W2VFPO2FO2YOBIKNDBBBYY","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":"e38beaeda68c9047cc9f2c240bb1445cad3cd9878e81847361ce7dc7d3b2bced","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-21T10:05:22Z","title_canon_sha256":"8deacae76aead62a3fdee7eb30c9b40e4b35b9e2e9dd986afa88c7030578f63f"},"schema_version":"1.0","source":{"id":"1412.6755","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.6755","created_at":"2026-05-18T02:30:46Z"},{"alias_kind":"arxiv_version","alias_value":"1412.6755v1","created_at":"2026-05-18T02:30:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6755","created_at":"2026-05-18T02:30:46Z"},{"alias_kind":"pith_short_12","alias_value":"GUK6W2VFPO2F","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GUK6W2VFPO2FO2YO","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GUK6W2VF","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:c83540ad7c263a727dc9be51bd09e1de6c1e95e2e9426bb0c61561eeda0ffbe8","target":"graph","created_at":"2026-05-18T02:30:46Z","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":"Given a complete edge-weighted graph G, we present a polynomial time algorithm to compute a degree-four-bounded spanning Eulerian subgraph of 2G that has at most 1.5 times the weight of an optimal TSP solution of G. Based on this algorithm and a novel use of orientations in graphs, we obtain a (3 beta/4 + 3 beta^2/4)-approximation algorithm for TSP with beta-relaxed triangle inequality (beta-TSP), where beta >= 1. A graph G is an instance of beta-TSP, if it is a complete graph with non-negative edge weights that are restricted as follows. For each triple of vertices u,v,w in V(G), c({u,v}) <= ","authors_text":"Tobias M\\\"omke","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-21T10:05:22Z","title":"An Improved Approximation Algorithm for the Traveling Salesman Problem with Relaxed Triangle Inequality"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6755","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:038c86d45cec93bb04d857b5a2b338416649a0d790a49f7204ae306439e16ac9","target":"record","created_at":"2026-05-18T02:30:46Z","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":"e38beaeda68c9047cc9f2c240bb1445cad3cd9878e81847361ce7dc7d3b2bced","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-21T10:05:22Z","title_canon_sha256":"8deacae76aead62a3fdee7eb30c9b40e4b35b9e2e9dd986afa88c7030578f63f"},"schema_version":"1.0","source":{"id":"1412.6755","kind":"arxiv","version":1}},"canonical_sha256":"3515eb6aa57bb4576b0e0a14d18421c603941df74cd5a4e8edd85a804df6d2dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3515eb6aa57bb4576b0e0a14d18421c603941df74cd5a4e8edd85a804df6d2dc","first_computed_at":"2026-05-18T02:30:46.293307Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:46.293307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ueB+NqtB2PfcTk+WqwemJUi6ExjOa+I7Ee6EbwyV/Tsvszbx0xmUSy3NO6KsgGvKyt6/JuJVINllGYBTT1aEDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:46.293711Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.6755","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:038c86d45cec93bb04d857b5a2b338416649a0d790a49f7204ae306439e16ac9","sha256:c83540ad7c263a727dc9be51bd09e1de6c1e95e2e9426bb0c61561eeda0ffbe8"],"state_sha256":"5b54f5578fd5addc0fe52c1483096acb2557360fb50609082ad573c70901c68b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nMTu6+LXri0ddWR+AwpU3yIA4BBlhkb6STLhTLw8YmvgMg1L87phIOy0JGj3WwqvGPmQSQuSah/8lXRHzgJHAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T00:43:24.147223Z","bundle_sha256":"aff68b75a8052a5dd02530310b98de18098cb933e5b0e1d44974e08c8e174197"}}