{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:KV4VV7P6X3Y3E43G6ZAEXBRJCQ","short_pith_number":"pith:KV4VV7P6","canonical_record":{"source":{"id":"1110.4604","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-20T18:50:21Z","cross_cats_sorted":[],"title_canon_sha256":"4bfde6271811b3b99c0bea08a4b0ef6972c57cb545f084fea629c9d04b54f61a","abstract_canon_sha256":"2f054f9cbf5040dc588415f2b46a4645fd028521ca7f9990a360b50ffce2e044"},"schema_version":"1.0"},"canonical_sha256":"55795afdfebef1b27366f6404b8629141860d7ec5eb0279bab04c7ea8866246c","source":{"kind":"arxiv","id":"1110.4604","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.4604","created_at":"2026-05-18T04:09:45Z"},{"alias_kind":"arxiv_version","alias_value":"1110.4604v2","created_at":"2026-05-18T04:09:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.4604","created_at":"2026-05-18T04:09:45Z"},{"alias_kind":"pith_short_12","alias_value":"KV4VV7P6X3Y3","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"KV4VV7P6X3Y3E43G","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"KV4VV7P6","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:KV4VV7P6X3Y3E43G6ZAEXBRJCQ","target":"record","payload":{"canonical_record":{"source":{"id":"1110.4604","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-20T18:50:21Z","cross_cats_sorted":[],"title_canon_sha256":"4bfde6271811b3b99c0bea08a4b0ef6972c57cb545f084fea629c9d04b54f61a","abstract_canon_sha256":"2f054f9cbf5040dc588415f2b46a4645fd028521ca7f9990a360b50ffce2e044"},"schema_version":"1.0"},"canonical_sha256":"55795afdfebef1b27366f6404b8629141860d7ec5eb0279bab04c7ea8866246c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:45.410279Z","signature_b64":"2xYfaxe3uT650SXyIcuDIl7AAvjcQRyr1IgVCgnM9OXy5yoHbjk5DoFeOe4Nq2xpBbgttBPtLaoypBdFCugOAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55795afdfebef1b27366f6404b8629141860d7ec5eb0279bab04c7ea8866246c","last_reissued_at":"2026-05-18T04:09:45.409819Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:45.409819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.4604","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-18T04:09:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SDu2cBr3Q5tuer5OUde4q2ORzM5HqQ+MidzdbJSVKl8uHETqvnQ4Leu2BmP3UYuEWExlb8XC9Klyx8ZWNcdqCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T16:39:03.404591Z"},"content_sha256":"cab9ccc7d4688aa0244ec9dd5d87968349d533b814108eb41161c6b0cff73217","schema_version":"1.0","event_id":"sha256:cab9ccc7d4688aa0244ec9dd5d87968349d533b814108eb41161c6b0cff73217"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:KV4VV7P6X3Y3E43G6ZAEXBRJCQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving Christofides' Algorithm for the s-t Path TSP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David B. Shmoys, Hyung-Chan An, Robert Kleinberg","submitted_at":"2011-10-20T18:50:21Z","abstract_excerpt":"We present a deterministic (1+sqrt(5))/2-approximation algorithm for the s-t path TSP for an arbitrary metric. Given a symmetric metric cost on n vertices including two prespecified endpoints, the problem is to find a shortest Hamiltonian path between the two endpoints; Hoogeveen showed that the natural variant of Christofides' algorithm is a 5/3-approximation algorithm for this problem, and this asymptotically tight bound in fact has been the best approximation ratio known until now. We modify this algorithm so that it chooses the initial spanning tree based on an optimal solution to the Held"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.4604","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-18T04:09:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kq4swet4BK0H25yNWuCJpGkF9vSYbRIEbcZmj9F3htTfixrQbYs8Zzf5omswbOuYXLA5PuMNZHZnRGCb9+BuAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T16:39:03.405328Z"},"content_sha256":"2072ff9240aa57599d557d7a5dc85e9a1ca01a4e5f33ace58621c08a435ecb0b","schema_version":"1.0","event_id":"sha256:2072ff9240aa57599d557d7a5dc85e9a1ca01a4e5f33ace58621c08a435ecb0b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KV4VV7P6X3Y3E43G6ZAEXBRJCQ/bundle.json","state_url":"https://pith.science/pith/KV4VV7P6X3Y3E43G6ZAEXBRJCQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KV4VV7P6X3Y3E43G6ZAEXBRJCQ/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-29T16:39:03Z","links":{"resolver":"https://pith.science/pith/KV4VV7P6X3Y3E43G6ZAEXBRJCQ","bundle":"https://pith.science/pith/KV4VV7P6X3Y3E43G6ZAEXBRJCQ/bundle.json","state":"https://pith.science/pith/KV4VV7P6X3Y3E43G6ZAEXBRJCQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KV4VV7P6X3Y3E43G6ZAEXBRJCQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:KV4VV7P6X3Y3E43G6ZAEXBRJCQ","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":"2f054f9cbf5040dc588415f2b46a4645fd028521ca7f9990a360b50ffce2e044","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-20T18:50:21Z","title_canon_sha256":"4bfde6271811b3b99c0bea08a4b0ef6972c57cb545f084fea629c9d04b54f61a"},"schema_version":"1.0","source":{"id":"1110.4604","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.4604","created_at":"2026-05-18T04:09:45Z"},{"alias_kind":"arxiv_version","alias_value":"1110.4604v2","created_at":"2026-05-18T04:09:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.4604","created_at":"2026-05-18T04:09:45Z"},{"alias_kind":"pith_short_12","alias_value":"KV4VV7P6X3Y3","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"KV4VV7P6X3Y3E43G","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"KV4VV7P6","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:2072ff9240aa57599d557d7a5dc85e9a1ca01a4e5f33ace58621c08a435ecb0b","target":"graph","created_at":"2026-05-18T04:09:45Z","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 deterministic (1+sqrt(5))/2-approximation algorithm for the s-t path TSP for an arbitrary metric. Given a symmetric metric cost on n vertices including two prespecified endpoints, the problem is to find a shortest Hamiltonian path between the two endpoints; Hoogeveen showed that the natural variant of Christofides' algorithm is a 5/3-approximation algorithm for this problem, and this asymptotically tight bound in fact has been the best approximation ratio known until now. We modify this algorithm so that it chooses the initial spanning tree based on an optimal solution to the Held","authors_text":"David B. Shmoys, Hyung-Chan An, Robert Kleinberg","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-20T18:50:21Z","title":"Improving Christofides' Algorithm for the s-t Path TSP"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.4604","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:cab9ccc7d4688aa0244ec9dd5d87968349d533b814108eb41161c6b0cff73217","target":"record","created_at":"2026-05-18T04:09:45Z","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":"2f054f9cbf5040dc588415f2b46a4645fd028521ca7f9990a360b50ffce2e044","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-20T18:50:21Z","title_canon_sha256":"4bfde6271811b3b99c0bea08a4b0ef6972c57cb545f084fea629c9d04b54f61a"},"schema_version":"1.0","source":{"id":"1110.4604","kind":"arxiv","version":2}},"canonical_sha256":"55795afdfebef1b27366f6404b8629141860d7ec5eb0279bab04c7ea8866246c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"55795afdfebef1b27366f6404b8629141860d7ec5eb0279bab04c7ea8866246c","first_computed_at":"2026-05-18T04:09:45.409819Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:09:45.409819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2xYfaxe3uT650SXyIcuDIl7AAvjcQRyr1IgVCgnM9OXy5yoHbjk5DoFeOe4Nq2xpBbgttBPtLaoypBdFCugOAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:09:45.410279Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.4604","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cab9ccc7d4688aa0244ec9dd5d87968349d533b814108eb41161c6b0cff73217","sha256:2072ff9240aa57599d557d7a5dc85e9a1ca01a4e5f33ace58621c08a435ecb0b"],"state_sha256":"cbeccf25ac14284b2334ffd0b23a12e64a5becb26eaafd29111f332bdd3f741d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y7hEQljZQhVCm5BqkO4Sef0e2NNLzo2Cs9pOqAhKQskolW31PXj68Wm6JRls29FPH8EtBPXauxLcEBVxdP67Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T16:39:03.408837Z","bundle_sha256":"1deb48a6b847bd782fe0f48215db600e5dc0378f7ce228d72ecaed6dfc0c4254"}}