{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:3SRHSKW2CAAQLB5F5PBDFGLSNR","short_pith_number":"pith:3SRHSKW2","schema_version":"1.0","canonical_sha256":"dca2792ada10010587a5ebc23299726c640056ac892d5e7e935116e82211d5bb","source":{"kind":"arxiv","id":"1112.2930","version":2},"attestation_state":"computed","paper":{"title":"Multiple Traveling Salesmen in Asymmetric Metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Zachary Friggstad","submitted_at":"2011-12-13T15:59:58Z","abstract_excerpt":"We consider some generalizations of the Asymmetric Traveling Salesman Path problem. Suppose we have an asymmetric metric G = (V,A) with two distinguished nodes s,t. We are also given a positive integer k. The goal is to find k paths of minimum total cost from s to t whose union spans all nodes. We call this the k-Person Asymmetric Traveling Salesmen Path problem (k-ATSPP). Our main result for k-ATSPP is a bicriteria approximation that, for some parameter b >= 1 we may choose, finds between k and k + k/b paths of total length O(b log |V|) times the optimum value of an LP relaxation based on the"},"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":"1112.2930","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-13T15:59:58Z","cross_cats_sorted":[],"title_canon_sha256":"b77b5e5ddef1de3c4a56c714b7996d32bb1fbb17fb4b2dec6fdf37512d38556a","abstract_canon_sha256":"89a7ccfa4e08846b41631525a68a88226445644dc12d5ba5d0286d5da64f733b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:20.338290Z","signature_b64":"huPvdeLzqt5q3SMT0gnhk4K9dtJ7ngZo59HbmHQydlO3mEfa5oPUfdsv3oev0GRjjI2rxJGkqGCpMDblTOs2Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dca2792ada10010587a5ebc23299726c640056ac892d5e7e935116e82211d5bb","last_reissued_at":"2026-05-18T04:06:20.337693Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:20.337693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multiple Traveling Salesmen in Asymmetric Metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Zachary Friggstad","submitted_at":"2011-12-13T15:59:58Z","abstract_excerpt":"We consider some generalizations of the Asymmetric Traveling Salesman Path problem. Suppose we have an asymmetric metric G = (V,A) with two distinguished nodes s,t. We are also given a positive integer k. The goal is to find k paths of minimum total cost from s to t whose union spans all nodes. We call this the k-Person Asymmetric Traveling Salesmen Path problem (k-ATSPP). Our main result for k-ATSPP is a bicriteria approximation that, for some parameter b >= 1 we may choose, finds between k and k + k/b paths of total length O(b log |V|) times the optimum value of an LP relaxation based on the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.2930","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":"1112.2930","created_at":"2026-05-18T04:06:20.337792+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.2930v2","created_at":"2026-05-18T04:06:20.337792+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2930","created_at":"2026-05-18T04:06:20.337792+00:00"},{"alias_kind":"pith_short_12","alias_value":"3SRHSKW2CAAQ","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"3SRHSKW2CAAQLB5F","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"3SRHSKW2","created_at":"2026-05-18T12:26:20.644004+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/3SRHSKW2CAAQLB5F5PBDFGLSNR","json":"https://pith.science/pith/3SRHSKW2CAAQLB5F5PBDFGLSNR.json","graph_json":"https://pith.science/api/pith-number/3SRHSKW2CAAQLB5F5PBDFGLSNR/graph.json","events_json":"https://pith.science/api/pith-number/3SRHSKW2CAAQLB5F5PBDFGLSNR/events.json","paper":"https://pith.science/paper/3SRHSKW2"},"agent_actions":{"view_html":"https://pith.science/pith/3SRHSKW2CAAQLB5F5PBDFGLSNR","download_json":"https://pith.science/pith/3SRHSKW2CAAQLB5F5PBDFGLSNR.json","view_paper":"https://pith.science/paper/3SRHSKW2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.2930&json=true","fetch_graph":"https://pith.science/api/pith-number/3SRHSKW2CAAQLB5F5PBDFGLSNR/graph.json","fetch_events":"https://pith.science/api/pith-number/3SRHSKW2CAAQLB5F5PBDFGLSNR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3SRHSKW2CAAQLB5F5PBDFGLSNR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3SRHSKW2CAAQLB5F5PBDFGLSNR/action/storage_attestation","attest_author":"https://pith.science/pith/3SRHSKW2CAAQLB5F5PBDFGLSNR/action/author_attestation","sign_citation":"https://pith.science/pith/3SRHSKW2CAAQLB5F5PBDFGLSNR/action/citation_signature","submit_replication":"https://pith.science/pith/3SRHSKW2CAAQLB5F5PBDFGLSNR/action/replication_record"}},"created_at":"2026-05-18T04:06:20.337792+00:00","updated_at":"2026-05-18T04:06:20.337792+00:00"}