{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:MZE5CGD7IVWTTHMXOFWUUTCTSX","short_pith_number":"pith:MZE5CGD7","canonical_record":{"source":{"id":"1502.03715","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-02-12T16:14:47Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"80e93e84e8d6fcee514f1b8130146b98ddedd39aa57d3f43a0028f2154aa00d2","abstract_canon_sha256":"3ab2d13b455b39868d373531c4b43b51bc7a009fdc59cc17cb4fb9d9929bb1a9"},"schema_version":"1.0"},"canonical_sha256":"6649d1187f456d399d97716d4a4c5395e41f635b967158f6578740c47af1916d","source":{"kind":"arxiv","id":"1502.03715","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.03715","created_at":"2026-05-18T01:23:24Z"},{"alias_kind":"arxiv_version","alias_value":"1502.03715v2","created_at":"2026-05-18T01:23:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03715","created_at":"2026-05-18T01:23:24Z"},{"alias_kind":"pith_short_12","alias_value":"MZE5CGD7IVWT","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MZE5CGD7IVWTTHMX","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MZE5CGD7","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:MZE5CGD7IVWTTHMXOFWUUTCTSX","target":"record","payload":{"canonical_record":{"source":{"id":"1502.03715","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-02-12T16:14:47Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"80e93e84e8d6fcee514f1b8130146b98ddedd39aa57d3f43a0028f2154aa00d2","abstract_canon_sha256":"3ab2d13b455b39868d373531c4b43b51bc7a009fdc59cc17cb4fb9d9929bb1a9"},"schema_version":"1.0"},"canonical_sha256":"6649d1187f456d399d97716d4a4c5395e41f635b967158f6578740c47af1916d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:24.517673Z","signature_b64":"vvLDxRWGgBjQpN1BDjsKsa0WKALYQC27Wex8wxrgslx8a2AQlIK0MCmDWbHkNFEA8Oey6VuQxuglSfW7Ls7SCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6649d1187f456d399d97716d4a4c5395e41f635b967158f6578740c47af1916d","last_reissued_at":"2026-05-18T01:23:24.517108Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:24.517108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.03715","source_version":2,"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-18T01:23:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f3i1j19KqUVC052uFwRNVms1nvOIxs2eMUDU2GKtdgcQkJv+SIn4SN8k0DWvkxJEN8m3tyxi4hyxdZUXE+JNCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:06:22.883556Z"},"content_sha256":"ca9ca0e85e76e20df9b57837f8757ad1ce182a12c0e28ed469dc08d1d84fbba0","schema_version":"1.0","event_id":"sha256:ca9ca0e85e76e20df9b57837f8757ad1ce182a12c0e28ed469dc08d1d84fbba0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:MZE5CGD7IVWTTHMXOFWUUTCTSX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reassembling trees for the traveling salesman","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Jens Vygen","submitted_at":"2015-02-12T16:14:47Z","abstract_excerpt":"Many recent approximation algorithms for different variants of the traveling salesman problem (asymmetric TSP, graph TSP, s-t-path TSP) exploit the well-known fact that a solution of the natural linear programming relaxation can be written as convex combination of spanning trees. The main argument then is that randomly sampling a tree from such a distribution and then completing the tree to a tour at minimum cost yields a better approximation guarantee than simply taking a minimum cost spanning tree (as in Christofides' algorithm). We argue that an additional step can help: reassembling the sp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03715","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"},"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-18T01:23:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MrvomMRVpDtLuyCP6fF0QITASgRyiJUV4oMdS/4uK5k3Z10FRzfHAgJJyzbqgyag/dfPZNg2ogJkFeX5rytCCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:06:22.884211Z"},"content_sha256":"920c21886907ee719c7dff667af80a9331934d4868f7e88c910cd898f1901456","schema_version":"1.0","event_id":"sha256:920c21886907ee719c7dff667af80a9331934d4868f7e88c910cd898f1901456"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MZE5CGD7IVWTTHMXOFWUUTCTSX/bundle.json","state_url":"https://pith.science/pith/MZE5CGD7IVWTTHMXOFWUUTCTSX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MZE5CGD7IVWTTHMXOFWUUTCTSX/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-30T12:06:22Z","links":{"resolver":"https://pith.science/pith/MZE5CGD7IVWTTHMXOFWUUTCTSX","bundle":"https://pith.science/pith/MZE5CGD7IVWTTHMXOFWUUTCTSX/bundle.json","state":"https://pith.science/pith/MZE5CGD7IVWTTHMXOFWUUTCTSX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MZE5CGD7IVWTTHMXOFWUUTCTSX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:MZE5CGD7IVWTTHMXOFWUUTCTSX","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":"3ab2d13b455b39868d373531c4b43b51bc7a009fdc59cc17cb4fb9d9929bb1a9","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-02-12T16:14:47Z","title_canon_sha256":"80e93e84e8d6fcee514f1b8130146b98ddedd39aa57d3f43a0028f2154aa00d2"},"schema_version":"1.0","source":{"id":"1502.03715","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.03715","created_at":"2026-05-18T01:23:24Z"},{"alias_kind":"arxiv_version","alias_value":"1502.03715v2","created_at":"2026-05-18T01:23:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03715","created_at":"2026-05-18T01:23:24Z"},{"alias_kind":"pith_short_12","alias_value":"MZE5CGD7IVWT","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MZE5CGD7IVWTTHMX","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MZE5CGD7","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:920c21886907ee719c7dff667af80a9331934d4868f7e88c910cd898f1901456","target":"graph","created_at":"2026-05-18T01:23:24Z","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":"Many recent approximation algorithms for different variants of the traveling salesman problem (asymmetric TSP, graph TSP, s-t-path TSP) exploit the well-known fact that a solution of the natural linear programming relaxation can be written as convex combination of spanning trees. The main argument then is that randomly sampling a tree from such a distribution and then completing the tree to a tour at minimum cost yields a better approximation guarantee than simply taking a minimum cost spanning tree (as in Christofides' algorithm). We argue that an additional step can help: reassembling the sp","authors_text":"Jens Vygen","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-02-12T16:14:47Z","title":"Reassembling trees for the traveling salesman"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03715","kind":"arxiv","version":2},"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:ca9ca0e85e76e20df9b57837f8757ad1ce182a12c0e28ed469dc08d1d84fbba0","target":"record","created_at":"2026-05-18T01:23:24Z","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":"3ab2d13b455b39868d373531c4b43b51bc7a009fdc59cc17cb4fb9d9929bb1a9","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-02-12T16:14:47Z","title_canon_sha256":"80e93e84e8d6fcee514f1b8130146b98ddedd39aa57d3f43a0028f2154aa00d2"},"schema_version":"1.0","source":{"id":"1502.03715","kind":"arxiv","version":2}},"canonical_sha256":"6649d1187f456d399d97716d4a4c5395e41f635b967158f6578740c47af1916d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6649d1187f456d399d97716d4a4c5395e41f635b967158f6578740c47af1916d","first_computed_at":"2026-05-18T01:23:24.517108Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:24.517108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vvLDxRWGgBjQpN1BDjsKsa0WKALYQC27Wex8wxrgslx8a2AQlIK0MCmDWbHkNFEA8Oey6VuQxuglSfW7Ls7SCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:24.517673Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.03715","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca9ca0e85e76e20df9b57837f8757ad1ce182a12c0e28ed469dc08d1d84fbba0","sha256:920c21886907ee719c7dff667af80a9331934d4868f7e88c910cd898f1901456"],"state_sha256":"fbbed849238daf40180cb0b1702a2466cff91fadb242c06cf4bd63406a6af77c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RMCxcWEHAAva6RFsmx16nkzU1KhYUyn+Pt39SKg1xnxr7KbyD3tgYjY8MSSZPwSFBlMvqBz4qNVZ4lSVpV9pDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T12:06:22.888020Z","bundle_sha256":"d73bf4d26fa556f5f4bdde5926aa67d37d5ee1bf255a1f360ba10c0a0e5e2240"}}