{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EMIRXZAQQPZXTPUNBTATZHRM6Z","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":"a74ad6bd078a5a33044e3a03d09bc4561da72c5986085851bd03750eb8186d50","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-31T07:34:37Z","title_canon_sha256":"a2a205aefa572a4a1b43eb5dc6424bfa17f14b9f4283675affe1b0377cce7861"},"schema_version":"1.0","source":{"id":"1512.09236","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.09236","created_at":"2026-05-18T01:18:52Z"},{"alias_kind":"arxiv_version","alias_value":"1512.09236v2","created_at":"2026-05-18T01:18:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.09236","created_at":"2026-05-18T01:18:52Z"},{"alias_kind":"pith_short_12","alias_value":"EMIRXZAQQPZX","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EMIRXZAQQPZXTPUN","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EMIRXZAQ","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:e2873cda2892fc083782290adbb16b862215fa37a3787bb412c1dc1eae0b5c35","target":"graph","created_at":"2026-05-18T01:18:52Z","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":"In the maximum traveling salesman problem (Max TSP) we are given a complete undirected graph with nonnegative weights on the edges and we wish to compute a traveling salesman tour of maximum weight. We present a fast combinatorial $\\frac 45$ - approximation algorithm for Max TSP. The previous best approximation for this problem was $\\frac 79$. The new algorithm is based on a novel technique of eliminating difficult subgraphs via half-edges, a new method of edge coloring and a technique of exchanging edges. A half-edge of edge $e=(u,v)$ is informally speaking \"a half of $e$ containing either $u","authors_text":"Bartosz Rybicki, Jan Marcinkowski, Katarzyna Paluch, Szymon Dudycz","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-31T07:34:37Z","title":"A $4/5$ - Approximation Algorithm for the Maximum Traveling Salesman Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.09236","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:197f3f03ff87ace3fa903fff97d8ffdbcc7c2755720eeec0106b3df93253e26c","target":"record","created_at":"2026-05-18T01:18:52Z","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":"a74ad6bd078a5a33044e3a03d09bc4561da72c5986085851bd03750eb8186d50","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-31T07:34:37Z","title_canon_sha256":"a2a205aefa572a4a1b43eb5dc6424bfa17f14b9f4283675affe1b0377cce7861"},"schema_version":"1.0","source":{"id":"1512.09236","kind":"arxiv","version":2}},"canonical_sha256":"23111be41083f379be8d0cc13c9e2cf6794ea056dc72251dbc723192f0552d13","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"23111be41083f379be8d0cc13c9e2cf6794ea056dc72251dbc723192f0552d13","first_computed_at":"2026-05-18T01:18:52.301899Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:52.301899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GFflyPzArJ0Ih7JNQ28LMsrQTYDH/AYVDX4af2/R5CYHx/NB0Eci7CN1N199Edyvw4jtXegH9Qe2M08WdgbZAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:52.302331Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.09236","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:197f3f03ff87ace3fa903fff97d8ffdbcc7c2755720eeec0106b3df93253e26c","sha256:e2873cda2892fc083782290adbb16b862215fa37a3787bb412c1dc1eae0b5c35"],"state_sha256":"2f6b3764d33714a620ebc96044d637eac7b9fea3b0860c3991d913d5a26e686d"}