{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:NXEJOLKCYBTV4LWXJWRPJ5HNLK","short_pith_number":"pith:NXEJOLKC","schema_version":"1.0","canonical_sha256":"6dc8972d42c0675e2ed74da2f4f4ed5ab825a624d1496b856ce6081971d54825","source":{"kind":"arxiv","id":"1405.1781","version":1},"attestation_state":"computed","paper":{"title":"Approximation Algorithms for the Asymmetric Traveling Salesman Problem : Describing two recent methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arka Bhattacharya","submitted_at":"2014-05-08T00:10:56Z","abstract_excerpt":"The paper provides a description of the two recent approximation algorithms for the Asymmetric Traveling Salesman Problem, giving the intuitive description of the works of Feige-Singh[1] and Asadpour et.al\\ [2].\\newline [1] improves the previous $O(\\log n)$ approximation algorithm, by improving the constant from 0.84 to 0.66 and modifying the work of Kaplan et. al\\ [3] and also shows an efficient reduction from ATSPP to ATSP. Combining both the results, they finally establish an approximation ratio of $\\left(\\frac{4}{3}+\\epsilon \\right)\\log n$ for ATSPP,\\ considering a small $\\epsilon>0$,\\ imp"},"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":"1405.1781","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-08T00:10:56Z","cross_cats_sorted":[],"title_canon_sha256":"3665ac96f11ba90cda30874a9c70f6ee65e5eb794b2ca4d90334780fa5d6c561","abstract_canon_sha256":"3c2737c3c70562976e5225721cb6f7775799755b4236c947117bda8da510391c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:22.494640Z","signature_b64":"QtoUp0clr9LDfKIJQo1GjGAM/e6y+8FZz/ULu+VCFsfcw5y95p1WpvMI90+51/kKUowc11yjjQk10R95iH2KAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6dc8972d42c0675e2ed74da2f4f4ed5ab825a624d1496b856ce6081971d54825","last_reissued_at":"2026-05-18T02:52:22.493937Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:22.493937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation Algorithms for the Asymmetric Traveling Salesman Problem : Describing two recent methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arka Bhattacharya","submitted_at":"2014-05-08T00:10:56Z","abstract_excerpt":"The paper provides a description of the two recent approximation algorithms for the Asymmetric Traveling Salesman Problem, giving the intuitive description of the works of Feige-Singh[1] and Asadpour et.al\\ [2].\\newline [1] improves the previous $O(\\log n)$ approximation algorithm, by improving the constant from 0.84 to 0.66 and modifying the work of Kaplan et. al\\ [3] and also shows an efficient reduction from ATSPP to ATSP. Combining both the results, they finally establish an approximation ratio of $\\left(\\frac{4}{3}+\\epsilon \\right)\\log n$ for ATSPP,\\ considering a small $\\epsilon>0$,\\ imp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1781","kind":"arxiv","version":1},"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":"1405.1781","created_at":"2026-05-18T02:52:22.494056+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.1781v1","created_at":"2026-05-18T02:52:22.494056+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1781","created_at":"2026-05-18T02:52:22.494056+00:00"},{"alias_kind":"pith_short_12","alias_value":"NXEJOLKCYBTV","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"NXEJOLKCYBTV4LWX","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"NXEJOLKC","created_at":"2026-05-18T12:28:41.024544+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/NXEJOLKCYBTV4LWXJWRPJ5HNLK","json":"https://pith.science/pith/NXEJOLKCYBTV4LWXJWRPJ5HNLK.json","graph_json":"https://pith.science/api/pith-number/NXEJOLKCYBTV4LWXJWRPJ5HNLK/graph.json","events_json":"https://pith.science/api/pith-number/NXEJOLKCYBTV4LWXJWRPJ5HNLK/events.json","paper":"https://pith.science/paper/NXEJOLKC"},"agent_actions":{"view_html":"https://pith.science/pith/NXEJOLKCYBTV4LWXJWRPJ5HNLK","download_json":"https://pith.science/pith/NXEJOLKCYBTV4LWXJWRPJ5HNLK.json","view_paper":"https://pith.science/paper/NXEJOLKC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.1781&json=true","fetch_graph":"https://pith.science/api/pith-number/NXEJOLKCYBTV4LWXJWRPJ5HNLK/graph.json","fetch_events":"https://pith.science/api/pith-number/NXEJOLKCYBTV4LWXJWRPJ5HNLK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NXEJOLKCYBTV4LWXJWRPJ5HNLK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NXEJOLKCYBTV4LWXJWRPJ5HNLK/action/storage_attestation","attest_author":"https://pith.science/pith/NXEJOLKCYBTV4LWXJWRPJ5HNLK/action/author_attestation","sign_citation":"https://pith.science/pith/NXEJOLKCYBTV4LWXJWRPJ5HNLK/action/citation_signature","submit_replication":"https://pith.science/pith/NXEJOLKCYBTV4LWXJWRPJ5HNLK/action/replication_record"}},"created_at":"2026-05-18T02:52:22.494056+00:00","updated_at":"2026-05-18T02:52:22.494056+00:00"}