{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NXEJOLKCYBTV4LWXJWRPJ5HNLK","short_pith_number":"pith:NXEJOLKC","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"},"canonical_sha256":"6dc8972d42c0675e2ed74da2f4f4ed5ab825a624d1496b856ce6081971d54825","source":{"kind":"arxiv","id":"1405.1781","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.1781","created_at":"2026-05-18T02:52:22Z"},{"alias_kind":"arxiv_version","alias_value":"1405.1781v1","created_at":"2026-05-18T02:52:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1781","created_at":"2026-05-18T02:52:22Z"},{"alias_kind":"pith_short_12","alias_value":"NXEJOLKCYBTV","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NXEJOLKCYBTV4LWX","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NXEJOLKC","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NXEJOLKCYBTV4LWXJWRPJ5HNLK","target":"record","payload":{"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"},"canonical_sha256":"6dc8972d42c0675e2ed74da2f4f4ed5ab825a624d1496b856ce6081971d54825","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"},"source_kind":"arxiv","source_id":"1405.1781","source_version":1,"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-18T02:52:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9nCWg8dVzN4yzCYqFczwyueMN2i9yNMQ+A19KLHbuJs2O1Qa1wONgWuifM9i7oulRZIJCIzbcvzdrTbVWqVkAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:45:19.469149Z"},"content_sha256":"f66b14c184ac5e0221745e1557a4ba1349ad4e6e1307e539b8c6d687eb82bf54","schema_version":"1.0","event_id":"sha256:f66b14c184ac5e0221745e1557a4ba1349ad4e6e1307e539b8c6d687eb82bf54"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NXEJOLKCYBTV4LWXJWRPJ5HNLK","target":"graph","payload":{"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"},"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-18T02:52:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oxGhM7KIbE8ABcuO/5lae8H5v3f8uBNImqahmAWzukJ54HOMO6fjdJwhBSHmOrMBkvFE0ZGYTFdTnPaTbC3BCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:45:19.469510Z"},"content_sha256":"043957fb0fa8004f3f0dbfa8e0e94cd6696b5116309d7bb43db6d0331e0f1760","schema_version":"1.0","event_id":"sha256:043957fb0fa8004f3f0dbfa8e0e94cd6696b5116309d7bb43db6d0331e0f1760"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NXEJOLKCYBTV4LWXJWRPJ5HNLK/bundle.json","state_url":"https://pith.science/pith/NXEJOLKCYBTV4LWXJWRPJ5HNLK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NXEJOLKCYBTV4LWXJWRPJ5HNLK/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-06-07T14:45:19Z","links":{"resolver":"https://pith.science/pith/NXEJOLKCYBTV4LWXJWRPJ5HNLK","bundle":"https://pith.science/pith/NXEJOLKCYBTV4LWXJWRPJ5HNLK/bundle.json","state":"https://pith.science/pith/NXEJOLKCYBTV4LWXJWRPJ5HNLK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NXEJOLKCYBTV4LWXJWRPJ5HNLK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NXEJOLKCYBTV4LWXJWRPJ5HNLK","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":"3c2737c3c70562976e5225721cb6f7775799755b4236c947117bda8da510391c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-08T00:10:56Z","title_canon_sha256":"3665ac96f11ba90cda30874a9c70f6ee65e5eb794b2ca4d90334780fa5d6c561"},"schema_version":"1.0","source":{"id":"1405.1781","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.1781","created_at":"2026-05-18T02:52:22Z"},{"alias_kind":"arxiv_version","alias_value":"1405.1781v1","created_at":"2026-05-18T02:52:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1781","created_at":"2026-05-18T02:52:22Z"},{"alias_kind":"pith_short_12","alias_value":"NXEJOLKCYBTV","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NXEJOLKCYBTV4LWX","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NXEJOLKC","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:043957fb0fa8004f3f0dbfa8e0e94cd6696b5116309d7bb43db6d0331e0f1760","target":"graph","created_at":"2026-05-18T02:52:22Z","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 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","authors_text":"Arka Bhattacharya","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-08T00:10:56Z","title":"Approximation Algorithms for the Asymmetric Traveling Salesman Problem : Describing two recent methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1781","kind":"arxiv","version":1},"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:f66b14c184ac5e0221745e1557a4ba1349ad4e6e1307e539b8c6d687eb82bf54","target":"record","created_at":"2026-05-18T02:52:22Z","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":"3c2737c3c70562976e5225721cb6f7775799755b4236c947117bda8da510391c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-08T00:10:56Z","title_canon_sha256":"3665ac96f11ba90cda30874a9c70f6ee65e5eb794b2ca4d90334780fa5d6c561"},"schema_version":"1.0","source":{"id":"1405.1781","kind":"arxiv","version":1}},"canonical_sha256":"6dc8972d42c0675e2ed74da2f4f4ed5ab825a624d1496b856ce6081971d54825","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6dc8972d42c0675e2ed74da2f4f4ed5ab825a624d1496b856ce6081971d54825","first_computed_at":"2026-05-18T02:52:22.493937Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:22.493937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QtoUp0clr9LDfKIJQo1GjGAM/e6y+8FZz/ULu+VCFsfcw5y95p1WpvMI90+51/kKUowc11yjjQk10R95iH2KAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:22.494640Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.1781","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f66b14c184ac5e0221745e1557a4ba1349ad4e6e1307e539b8c6d687eb82bf54","sha256:043957fb0fa8004f3f0dbfa8e0e94cd6696b5116309d7bb43db6d0331e0f1760"],"state_sha256":"233a130be7ecf00ccd270580a51038efedbb55174262db71f97fb2ed539bd6d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"15Oc1jG6kL06a8AL/opvbP9eUUzjmFzO0ov4NngIAF+YtS6h8dn4Lga9YBQPCLofRLPkClDtV8exo0+8vYAdDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T14:45:19.471402Z","bundle_sha256":"844dd3319dfc9260d3ffa35e0a61412fba5bc85be9bae76485bf9edaf9bb422f"}}