{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2RDVRQAT6SYRI6JY6HQM72IUFT","short_pith_number":"pith:2RDVRQAT","canonical_record":{"source":{"id":"1401.3670","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-15T17:02:40Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"4f771641df3d913c0b0b12983c58fb7230baf0c7b18cdff8bc01fdb01cef20a8","abstract_canon_sha256":"de4cf9cba796cca0f057920ac20d307ded513a46c2473cdd35a43e4b433892f6"},"schema_version":"1.0"},"canonical_sha256":"d44758c013f4b1147938f1e0cfe9142cc47ea8eff05a5108285cf1467005d555","source":{"kind":"arxiv","id":"1401.3670","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3670","created_at":"2026-05-18T03:02:08Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3670v1","created_at":"2026-05-18T03:02:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3670","created_at":"2026-05-18T03:02:08Z"},{"alias_kind":"pith_short_12","alias_value":"2RDVRQAT6SYR","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2RDVRQAT6SYRI6JY","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2RDVRQAT","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2RDVRQAT6SYRI6JY6HQM72IUFT","target":"record","payload":{"canonical_record":{"source":{"id":"1401.3670","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-15T17:02:40Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"4f771641df3d913c0b0b12983c58fb7230baf0c7b18cdff8bc01fdb01cef20a8","abstract_canon_sha256":"de4cf9cba796cca0f057920ac20d307ded513a46c2473cdd35a43e4b433892f6"},"schema_version":"1.0"},"canonical_sha256":"d44758c013f4b1147938f1e0cfe9142cc47ea8eff05a5108285cf1467005d555","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:08.001598Z","signature_b64":"fSrNN9zQ6z5uso9oiOBzapnJgkdMrcpZCgi/XGoO0gbGmFVzdVo9bMsYUGpT2RcyDezdXPGuSwYCkCe+AQNsCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d44758c013f4b1147938f1e0cfe9142cc47ea8eff05a5108285cf1467005d555","last_reissued_at":"2026-05-18T03:02:08.001132Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:08.001132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.3670","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-18T03:02:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Zw15YTFOTMl0hHMfr8mgsYnCvedJl8e9l47QmlRQMW0i67D+fuFb06C9qLIYosQtkQngTH/T7jY6S/ZLv25CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T15:45:11.778808Z"},"content_sha256":"4b134671391735c234bc372912bfef463695f6670ba7ce1b82ad3cff94f86460","schema_version":"1.0","event_id":"sha256:4b134671391735c234bc372912bfef463695f6670ba7ce1b82ad3cff94f86460"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2RDVRQAT6SYRI6JY6HQM72IUFT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Better Approximation Algorithms for Maximum Asymmetric Traveling Salesman and Shortest Superstring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Katarzyna Paluch","submitted_at":"2014-01-15T17:02:40Z","abstract_excerpt":"In the maximum asymmetric traveling salesman problem (Max ATSP) we are given a complete directed graph with nonnegative weights on the edges and we wish to compute a traveling salesman tour of maximum weight. In this paper we give a fast combinatorial $\\frac 34$-approximation algorithm for Max ATSP. It is based on a novel use of {\\it half-edges}, matchings and a new method of edge coloring. (A {\\it half-edge} of edge $(u,v)$ is informally speaking \"either a head or a tail of $(u,v)$\".) The current best approximation algorithms for Max ATSP, achieving the approximation guarantee of $\\frac 23$, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3670","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-18T03:02:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HLfoNKa65sh/46PU9/IU6/oulgwCqqyFkEPFB4LcglD+02x6ElqGAJcFO1b0Wk/3Akxcyovm2AWDPlTe1lDcCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T15:45:11.779158Z"},"content_sha256":"17e1b60689669dbc1eff01a29becf6143851629cd3b915ec2045900e5d03862a","schema_version":"1.0","event_id":"sha256:17e1b60689669dbc1eff01a29becf6143851629cd3b915ec2045900e5d03862a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2RDVRQAT6SYRI6JY6HQM72IUFT/bundle.json","state_url":"https://pith.science/pith/2RDVRQAT6SYRI6JY6HQM72IUFT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2RDVRQAT6SYRI6JY6HQM72IUFT/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-25T15:45:11Z","links":{"resolver":"https://pith.science/pith/2RDVRQAT6SYRI6JY6HQM72IUFT","bundle":"https://pith.science/pith/2RDVRQAT6SYRI6JY6HQM72IUFT/bundle.json","state":"https://pith.science/pith/2RDVRQAT6SYRI6JY6HQM72IUFT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2RDVRQAT6SYRI6JY6HQM72IUFT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2RDVRQAT6SYRI6JY6HQM72IUFT","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":"de4cf9cba796cca0f057920ac20d307ded513a46c2473cdd35a43e4b433892f6","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-15T17:02:40Z","title_canon_sha256":"4f771641df3d913c0b0b12983c58fb7230baf0c7b18cdff8bc01fdb01cef20a8"},"schema_version":"1.0","source":{"id":"1401.3670","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3670","created_at":"2026-05-18T03:02:08Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3670v1","created_at":"2026-05-18T03:02:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3670","created_at":"2026-05-18T03:02:08Z"},{"alias_kind":"pith_short_12","alias_value":"2RDVRQAT6SYR","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2RDVRQAT6SYRI6JY","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2RDVRQAT","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:17e1b60689669dbc1eff01a29becf6143851629cd3b915ec2045900e5d03862a","target":"graph","created_at":"2026-05-18T03:02:08Z","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 asymmetric traveling salesman problem (Max ATSP) we are given a complete directed graph with nonnegative weights on the edges and we wish to compute a traveling salesman tour of maximum weight. In this paper we give a fast combinatorial $\\frac 34$-approximation algorithm for Max ATSP. It is based on a novel use of {\\it half-edges}, matchings and a new method of edge coloring. (A {\\it half-edge} of edge $(u,v)$ is informally speaking \"either a head or a tail of $(u,v)$\".) The current best approximation algorithms for Max ATSP, achieving the approximation guarantee of $\\frac 23$, ","authors_text":"Katarzyna Paluch","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-15T17:02:40Z","title":"Better Approximation Algorithms for Maximum Asymmetric Traveling Salesman and Shortest Superstring"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3670","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:4b134671391735c234bc372912bfef463695f6670ba7ce1b82ad3cff94f86460","target":"record","created_at":"2026-05-18T03:02:08Z","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":"de4cf9cba796cca0f057920ac20d307ded513a46c2473cdd35a43e4b433892f6","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-15T17:02:40Z","title_canon_sha256":"4f771641df3d913c0b0b12983c58fb7230baf0c7b18cdff8bc01fdb01cef20a8"},"schema_version":"1.0","source":{"id":"1401.3670","kind":"arxiv","version":1}},"canonical_sha256":"d44758c013f4b1147938f1e0cfe9142cc47ea8eff05a5108285cf1467005d555","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d44758c013f4b1147938f1e0cfe9142cc47ea8eff05a5108285cf1467005d555","first_computed_at":"2026-05-18T03:02:08.001132Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:08.001132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fSrNN9zQ6z5uso9oiOBzapnJgkdMrcpZCgi/XGoO0gbGmFVzdVo9bMsYUGpT2RcyDezdXPGuSwYCkCe+AQNsCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:08.001598Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.3670","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b134671391735c234bc372912bfef463695f6670ba7ce1b82ad3cff94f86460","sha256:17e1b60689669dbc1eff01a29becf6143851629cd3b915ec2045900e5d03862a"],"state_sha256":"27789286fec0dbbc31fc6fe3a0b8225a540ab549a26fb599852d9b7c0bf777d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6WqIlnEDYUpahrlipNQnPKHoHEQZv+cQ79zc94arGCBd2JWtYVJJEw1g2Yj3807E53UWkmBejXJ4KcNFoJy6CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T15:45:11.781112Z","bundle_sha256":"8f217923691e283b489647f3bbc1a1135fba6e15cd2a54039ef4602f623dd1cb"}}