{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:PKWEAIJJAEEBNDTBH4WBB5VDKR","short_pith_number":"pith:PKWEAIJJ","canonical_record":{"source":{"id":"0711.2157","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2007-11-14T10:53:49Z","cross_cats_sorted":[],"title_canon_sha256":"0bba0cece70826440ea5ecbdb7308ed75656e44b6015d31fe7c44a183b6552f2","abstract_canon_sha256":"e895ec119559e524477fbac5536fb1e6afc4c206177473bb6c5982f1a67b95c4"},"schema_version":"1.0"},"canonical_sha256":"7aac4021290108168e613f2c10f6a3544012c989fdf6ee93add5f38beaeaff78","source":{"kind":"arxiv","id":"0711.2157","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0711.2157","created_at":"2026-05-18T04:18:23Z"},{"alias_kind":"arxiv_version","alias_value":"0711.2157v3","created_at":"2026-05-18T04:18:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0711.2157","created_at":"2026-05-18T04:18:23Z"},{"alias_kind":"pith_short_12","alias_value":"PKWEAIJJAEEB","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"PKWEAIJJAEEBNDTB","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"PKWEAIJJ","created_at":"2026-05-18T12:25:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:PKWEAIJJAEEBNDTBH4WBB5VDKR","target":"record","payload":{"canonical_record":{"source":{"id":"0711.2157","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2007-11-14T10:53:49Z","cross_cats_sorted":[],"title_canon_sha256":"0bba0cece70826440ea5ecbdb7308ed75656e44b6015d31fe7c44a183b6552f2","abstract_canon_sha256":"e895ec119559e524477fbac5536fb1e6afc4c206177473bb6c5982f1a67b95c4"},"schema_version":"1.0"},"canonical_sha256":"7aac4021290108168e613f2c10f6a3544012c989fdf6ee93add5f38beaeaff78","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:23.949966Z","signature_b64":"OQ8dZIl9R8L9GUFHeTgGDsmq6W2tNi/ZFqAv+rJU1XHl0C2kzhqoJdXyKxiSHH9bS8oORsyymgn0+ShZXb4DDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7aac4021290108168e613f2c10f6a3544012c989fdf6ee93add5f38beaeaff78","last_reissued_at":"2026-05-18T04:18:23.949422Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:23.949422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0711.2157","source_version":3,"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-18T04:18:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kk2Wej00VyfkLPA4Ch4GnOIlR1P+NtQhhEooJ78e5924K5QHFW0bs3ODp8arAGkpC0CntJAsxr87ZYlyOBnBDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T02:27:29.663597Z"},"content_sha256":"1994947490a1558f57a4d550a0679e82083eb15150595704798fb439e1531ee0","schema_version":"1.0","event_id":"sha256:1994947490a1558f57a4d550a0679e82083eb15150595704798fb439e1531ee0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:PKWEAIJJAEEBNDTBH4WBB5VDKR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Approximating Multi-Criteria TSP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bodo Manthey","submitted_at":"2007-11-14T10:53:49Z","abstract_excerpt":"We present approximation algorithms for almost all variants of the multi-criteria traveling salesman problem (TSP).\n  First, we devise randomized approximation algorithms for multi-criteria maximum traveling salesman problems (Max-TSP). For multi-criteria Max-STSP, where the edge weights have to be symmetric, we devise an algorithm with an approximation ratio of 2/3 - eps. For multi-criteria Max-ATSP, where the edge weights may be asymmetric, we present an algorithm with a ratio of 1/2 - eps. Our algorithms work for any fixed number k of objectives. Furthermore, we present a deterministic algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0711.2157","kind":"arxiv","version":3},"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-18T04:18:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VDxN17IdJSQhGknm2+sxgqDBMOZH7K2iNf7TKHi0qKcttiQ08+8PiIZB3JueZAeSoyONUW946EFgXxMwDvZsAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T02:27:29.664374Z"},"content_sha256":"c35bff229ead445ebe8a898d4366bf5923b2fc2a32e3563e9322a1c6804bb27d","schema_version":"1.0","event_id":"sha256:c35bff229ead445ebe8a898d4366bf5923b2fc2a32e3563e9322a1c6804bb27d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PKWEAIJJAEEBNDTBH4WBB5VDKR/bundle.json","state_url":"https://pith.science/pith/PKWEAIJJAEEBNDTBH4WBB5VDKR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PKWEAIJJAEEBNDTBH4WBB5VDKR/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-06-12T02:27:29Z","links":{"resolver":"https://pith.science/pith/PKWEAIJJAEEBNDTBH4WBB5VDKR","bundle":"https://pith.science/pith/PKWEAIJJAEEBNDTBH4WBB5VDKR/bundle.json","state":"https://pith.science/pith/PKWEAIJJAEEBNDTBH4WBB5VDKR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PKWEAIJJAEEBNDTBH4WBB5VDKR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:PKWEAIJJAEEBNDTBH4WBB5VDKR","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":"e895ec119559e524477fbac5536fb1e6afc4c206177473bb6c5982f1a67b95c4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2007-11-14T10:53:49Z","title_canon_sha256":"0bba0cece70826440ea5ecbdb7308ed75656e44b6015d31fe7c44a183b6552f2"},"schema_version":"1.0","source":{"id":"0711.2157","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0711.2157","created_at":"2026-05-18T04:18:23Z"},{"alias_kind":"arxiv_version","alias_value":"0711.2157v3","created_at":"2026-05-18T04:18:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0711.2157","created_at":"2026-05-18T04:18:23Z"},{"alias_kind":"pith_short_12","alias_value":"PKWEAIJJAEEB","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"PKWEAIJJAEEBNDTB","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"PKWEAIJJ","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:c35bff229ead445ebe8a898d4366bf5923b2fc2a32e3563e9322a1c6804bb27d","target":"graph","created_at":"2026-05-18T04:18:23Z","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 approximation algorithms for almost all variants of the multi-criteria traveling salesman problem (TSP).\n  First, we devise randomized approximation algorithms for multi-criteria maximum traveling salesman problems (Max-TSP). For multi-criteria Max-STSP, where the edge weights have to be symmetric, we devise an algorithm with an approximation ratio of 2/3 - eps. For multi-criteria Max-ATSP, where the edge weights may be asymmetric, we present an algorithm with a ratio of 1/2 - eps. Our algorithms work for any fixed number k of objectives. Furthermore, we present a deterministic algo","authors_text":"Bodo Manthey","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2007-11-14T10:53:49Z","title":"On Approximating Multi-Criteria TSP"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0711.2157","kind":"arxiv","version":3},"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:1994947490a1558f57a4d550a0679e82083eb15150595704798fb439e1531ee0","target":"record","created_at":"2026-05-18T04:18:23Z","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":"e895ec119559e524477fbac5536fb1e6afc4c206177473bb6c5982f1a67b95c4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2007-11-14T10:53:49Z","title_canon_sha256":"0bba0cece70826440ea5ecbdb7308ed75656e44b6015d31fe7c44a183b6552f2"},"schema_version":"1.0","source":{"id":"0711.2157","kind":"arxiv","version":3}},"canonical_sha256":"7aac4021290108168e613f2c10f6a3544012c989fdf6ee93add5f38beaeaff78","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7aac4021290108168e613f2c10f6a3544012c989fdf6ee93add5f38beaeaff78","first_computed_at":"2026-05-18T04:18:23.949422Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:18:23.949422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OQ8dZIl9R8L9GUFHeTgGDsmq6W2tNi/ZFqAv+rJU1XHl0C2kzhqoJdXyKxiSHH9bS8oORsyymgn0+ShZXb4DDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:18:23.949966Z","signed_message":"canonical_sha256_bytes"},"source_id":"0711.2157","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1994947490a1558f57a4d550a0679e82083eb15150595704798fb439e1531ee0","sha256:c35bff229ead445ebe8a898d4366bf5923b2fc2a32e3563e9322a1c6804bb27d"],"state_sha256":"c3526ea49214398a485044ce6c82400a919f835ab7c3bde9a5e093d2792ed7b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3a1WPYN0p3/OHG64mvm7U1rycS1UsIuPz9Glky6JAbCh8RNAonZxYhIo376R1nomKkC8MArnwWmjJBVIXniBCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T02:27:29.668654Z","bundle_sha256":"d1031ad02abeb06f8910081bf98b3abd9f2d1b873e318c5384603bfdc6f4c7e8"}}