{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:IH7GAH3N45D2TYUNUSOHIHIOUS","short_pith_number":"pith:IH7GAH3N","canonical_record":{"source":{"id":"1502.00447","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2015-02-02T12:07:37Z","cross_cats_sorted":[],"title_canon_sha256":"4d1fa3d5f388d9438b491fe323328d23cf1ccf7f9dd96cf1efc5f927f0996824","abstract_canon_sha256":"950852534c3d818a1f7a7012290e8f67d523d4b011dd873b5072532a2f39df2d"},"schema_version":"1.0"},"canonical_sha256":"41fe601f6de747a9e28da49c741d0ea491f6914ba59cbad1b8e37f0ebe7ab0ef","source":{"kind":"arxiv","id":"1502.00447","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.00447","created_at":"2026-05-18T00:55:25Z"},{"alias_kind":"arxiv_version","alias_value":"1502.00447v2","created_at":"2026-05-18T00:55:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00447","created_at":"2026-05-18T00:55:25Z"},{"alias_kind":"pith_short_12","alias_value":"IH7GAH3N45D2","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IH7GAH3N45D2TYUN","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IH7GAH3N","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:IH7GAH3N45D2TYUNUSOHIHIOUS","target":"record","payload":{"canonical_record":{"source":{"id":"1502.00447","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2015-02-02T12:07:37Z","cross_cats_sorted":[],"title_canon_sha256":"4d1fa3d5f388d9438b491fe323328d23cf1ccf7f9dd96cf1efc5f927f0996824","abstract_canon_sha256":"950852534c3d818a1f7a7012290e8f67d523d4b011dd873b5072532a2f39df2d"},"schema_version":"1.0"},"canonical_sha256":"41fe601f6de747a9e28da49c741d0ea491f6914ba59cbad1b8e37f0ebe7ab0ef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:25.813982Z","signature_b64":"AXlAAswo6ZTVt4niUHawnpxOo+MvoyKPAE/6i1BilSjUY6sjmbCTg6Uqp5vAmydFYxK7NlWq4i0Dn3hk5XqpCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41fe601f6de747a9e28da49c741d0ea491f6914ba59cbad1b8e37f0ebe7ab0ef","last_reissued_at":"2026-05-18T00:55:25.813342Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:25.813342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.00447","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-18T00:55:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"It1hvb3kRztsLTLCJFY2d84uOxAcZd2YM91GJe1JVo34GIi+VULA9do7PAC2amvWRf7MgN1PVS/GfYGCPyBLBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T09:25:33.758750Z"},"content_sha256":"34231f89e37ab1bf3ed0170c51c1755df62a221b49bd165d661335eef053254a","schema_version":"1.0","event_id":"sha256:34231f89e37ab1bf3ed0170c51c1755df62a221b49bd165d661335eef053254a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:IH7GAH3N45D2TYUNUSOHIHIOUS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Obtaining Quality-Proved Near Optimal Results for Traveling Salesman Problem","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chaojie Huang, Qin Xiong, Wenhong Tian, Xinyang Wang","submitted_at":"2015-02-02T12:07:37Z","abstract_excerpt":"The traveling salesman problem (TSP) is one of the most challenging NP-hard problems. It has widely applications in various disciplines such as physics, biology, computer science and so forth. The best known approximation algorithm for Symmetric TSP (STSP) whose cost matrix satisfies the triangle inequality (called $\\triangle$STSP) is Christofides algorithm which was proposed in 1976 and is a $\\frac{3}{2}$-approximation. Since then no proved improvement is made and improving upon this bound is a fundamental open question in combinatorial optimization.\n  In this paper, for the first time, we pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00447","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-18T00:55:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2FiW1a9VN+Fqw/ehqHcaEtLYhjq44hnVv4xRwwPLXYyA2gOlmDPmyJAwcEc8ILUjoV5Lu6CmyHpBhM0EQy8WCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T09:25:33.759198Z"},"content_sha256":"abf453e2a8b59bf018726872bfa6fa90c36312739deafd7d2c3c42faaf85f3b4","schema_version":"1.0","event_id":"sha256:abf453e2a8b59bf018726872bfa6fa90c36312739deafd7d2c3c42faaf85f3b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IH7GAH3N45D2TYUNUSOHIHIOUS/bundle.json","state_url":"https://pith.science/pith/IH7GAH3N45D2TYUNUSOHIHIOUS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IH7GAH3N45D2TYUNUSOHIHIOUS/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-08-11T09:25:33Z","links":{"resolver":"https://pith.science/pith/IH7GAH3N45D2TYUNUSOHIHIOUS","bundle":"https://pith.science/pith/IH7GAH3N45D2TYUNUSOHIHIOUS/bundle.json","state":"https://pith.science/pith/IH7GAH3N45D2TYUNUSOHIHIOUS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IH7GAH3N45D2TYUNUSOHIHIOUS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IH7GAH3N45D2TYUNUSOHIHIOUS","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":"950852534c3d818a1f7a7012290e8f67d523d4b011dd873b5072532a2f39df2d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2015-02-02T12:07:37Z","title_canon_sha256":"4d1fa3d5f388d9438b491fe323328d23cf1ccf7f9dd96cf1efc5f927f0996824"},"schema_version":"1.0","source":{"id":"1502.00447","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.00447","created_at":"2026-05-18T00:55:25Z"},{"alias_kind":"arxiv_version","alias_value":"1502.00447v2","created_at":"2026-05-18T00:55:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00447","created_at":"2026-05-18T00:55:25Z"},{"alias_kind":"pith_short_12","alias_value":"IH7GAH3N45D2","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IH7GAH3N45D2TYUN","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IH7GAH3N","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:abf453e2a8b59bf018726872bfa6fa90c36312739deafd7d2c3c42faaf85f3b4","target":"graph","created_at":"2026-05-18T00:55:25Z","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":"The traveling salesman problem (TSP) is one of the most challenging NP-hard problems. It has widely applications in various disciplines such as physics, biology, computer science and so forth. The best known approximation algorithm for Symmetric TSP (STSP) whose cost matrix satisfies the triangle inequality (called $\\triangle$STSP) is Christofides algorithm which was proposed in 1976 and is a $\\frac{3}{2}$-approximation. Since then no proved improvement is made and improving upon this bound is a fundamental open question in combinatorial optimization.\n  In this paper, for the first time, we pr","authors_text":"Chaojie Huang, Qin Xiong, Wenhong Tian, Xinyang Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2015-02-02T12:07:37Z","title":"Obtaining Quality-Proved Near Optimal Results for Traveling Salesman Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00447","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:34231f89e37ab1bf3ed0170c51c1755df62a221b49bd165d661335eef053254a","target":"record","created_at":"2026-05-18T00:55:25Z","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":"950852534c3d818a1f7a7012290e8f67d523d4b011dd873b5072532a2f39df2d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2015-02-02T12:07:37Z","title_canon_sha256":"4d1fa3d5f388d9438b491fe323328d23cf1ccf7f9dd96cf1efc5f927f0996824"},"schema_version":"1.0","source":{"id":"1502.00447","kind":"arxiv","version":2}},"canonical_sha256":"41fe601f6de747a9e28da49c741d0ea491f6914ba59cbad1b8e37f0ebe7ab0ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41fe601f6de747a9e28da49c741d0ea491f6914ba59cbad1b8e37f0ebe7ab0ef","first_computed_at":"2026-05-18T00:55:25.813342Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:25.813342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AXlAAswo6ZTVt4niUHawnpxOo+MvoyKPAE/6i1BilSjUY6sjmbCTg6Uqp5vAmydFYxK7NlWq4i0Dn3hk5XqpCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:25.813982Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.00447","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34231f89e37ab1bf3ed0170c51c1755df62a221b49bd165d661335eef053254a","sha256:abf453e2a8b59bf018726872bfa6fa90c36312739deafd7d2c3c42faaf85f3b4"],"state_sha256":"6a21a825b0c6ab9ae1de83bf49f0377d0885889cb07c321d6f1a10134a939907"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/7ieOiNzUmh5Ziu8Pf2n3eO/K93leCvQfcgTUJK4h6kIGag1Nb142zdoEV3Gfmyoepv3lcx7GcioklpOOXAdAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T09:25:33.762440Z","bundle_sha256":"272fbc5f817abbdc08852c9232254e5f4eb5c27110b80220036b6e9b2776fd51"}}