{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:EMIRXZAQQPZXTPUNBTATZHRM6Z","short_pith_number":"pith:EMIRXZAQ","schema_version":"1.0","canonical_sha256":"23111be41083f379be8d0cc13c9e2cf6794ea056dc72251dbc723192f0552d13","source":{"kind":"arxiv","id":"1512.09236","version":2},"attestation_state":"computed","paper":{"title":"A $4/5$ - Approximation Algorithm for the Maximum Traveling Salesman Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Bartosz Rybicki, Jan Marcinkowski, Katarzyna Paluch, Szymon Dudycz","submitted_at":"2015-12-31T07:34:37Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1512.09236","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-31T07:34:37Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"a2a205aefa572a4a1b43eb5dc6424bfa17f14b9f4283675affe1b0377cce7861","abstract_canon_sha256":"a74ad6bd078a5a33044e3a03d09bc4561da72c5986085851bd03750eb8186d50"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:52.302331Z","signature_b64":"GFflyPzArJ0Ih7JNQ28LMsrQTYDH/AYVDX4af2/R5CYHx/NB0Eci7CN1N199Edyvw4jtXegH9Qe2M08WdgbZAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23111be41083f379be8d0cc13c9e2cf6794ea056dc72251dbc723192f0552d13","last_reissued_at":"2026-05-18T01:18:52.301899Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:52.301899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A $4/5$ - Approximation Algorithm for the Maximum Traveling Salesman Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Bartosz Rybicki, Jan Marcinkowski, Katarzyna Paluch, Szymon Dudycz","submitted_at":"2015-12-31T07:34:37Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.09236","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1512.09236","created_at":"2026-05-18T01:18:52.301959+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.09236v2","created_at":"2026-05-18T01:18:52.301959+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.09236","created_at":"2026-05-18T01:18:52.301959+00:00"},{"alias_kind":"pith_short_12","alias_value":"EMIRXZAQQPZX","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"EMIRXZAQQPZXTPUN","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"EMIRXZAQ","created_at":"2026-05-18T12:29:19.899920+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EMIRXZAQQPZXTPUNBTATZHRM6Z","json":"https://pith.science/pith/EMIRXZAQQPZXTPUNBTATZHRM6Z.json","graph_json":"https://pith.science/api/pith-number/EMIRXZAQQPZXTPUNBTATZHRM6Z/graph.json","events_json":"https://pith.science/api/pith-number/EMIRXZAQQPZXTPUNBTATZHRM6Z/events.json","paper":"https://pith.science/paper/EMIRXZAQ"},"agent_actions":{"view_html":"https://pith.science/pith/EMIRXZAQQPZXTPUNBTATZHRM6Z","download_json":"https://pith.science/pith/EMIRXZAQQPZXTPUNBTATZHRM6Z.json","view_paper":"https://pith.science/paper/EMIRXZAQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.09236&json=true","fetch_graph":"https://pith.science/api/pith-number/EMIRXZAQQPZXTPUNBTATZHRM6Z/graph.json","fetch_events":"https://pith.science/api/pith-number/EMIRXZAQQPZXTPUNBTATZHRM6Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EMIRXZAQQPZXTPUNBTATZHRM6Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EMIRXZAQQPZXTPUNBTATZHRM6Z/action/storage_attestation","attest_author":"https://pith.science/pith/EMIRXZAQQPZXTPUNBTATZHRM6Z/action/author_attestation","sign_citation":"https://pith.science/pith/EMIRXZAQQPZXTPUNBTATZHRM6Z/action/citation_signature","submit_replication":"https://pith.science/pith/EMIRXZAQQPZXTPUNBTATZHRM6Z/action/replication_record"}},"created_at":"2026-05-18T01:18:52.301959+00:00","updated_at":"2026-05-18T01:18:52.301959+00:00"}