{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:3SRHSKW2CAAQLB5F5PBDFGLSNR","short_pith_number":"pith:3SRHSKW2","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"},"canonical_sha256":"dca2792ada10010587a5ebc23299726c640056ac892d5e7e935116e82211d5bb","source":{"kind":"arxiv","id":"1112.2930","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.2930","created_at":"2026-05-18T04:06:20Z"},{"alias_kind":"arxiv_version","alias_value":"1112.2930v2","created_at":"2026-05-18T04:06:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2930","created_at":"2026-05-18T04:06:20Z"},{"alias_kind":"pith_short_12","alias_value":"3SRHSKW2CAAQ","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"3SRHSKW2CAAQLB5F","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"3SRHSKW2","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:3SRHSKW2CAAQLB5F5PBDFGLSNR","target":"record","payload":{"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"},"canonical_sha256":"dca2792ada10010587a5ebc23299726c640056ac892d5e7e935116e82211d5bb","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"},"source_kind":"arxiv","source_id":"1112.2930","source_version":2,"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-18T04:06:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2pe7OCxVHPbqDDvr2BubsBMLMvNU7+ZXzs0eA47gNvGQigLsTqJDOehr9QPKXNxesLz+Eh0CS0uIVsX3M9n/BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:28:21.435675Z"},"content_sha256":"957c63f9cada19eb4ac716307293b4052d3434c3095807692a2b769a1a0ca6ea","schema_version":"1.0","event_id":"sha256:957c63f9cada19eb4ac716307293b4052d3434c3095807692a2b769a1a0ca6ea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:3SRHSKW2CAAQLB5F5PBDFGLSNR","target":"graph","payload":{"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"},"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-18T04:06:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gigtN/FC6MBaFGvVA4iC+D3NJfzQfbmefcKCzBa6cF1DbySkfJASPAy6+Apv/tzUdu0Iuo1hca9YR7jbHgfnAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:28:21.436346Z"},"content_sha256":"235d4a2d68c0fc3c1cc1a741993109fdd564a4d4bf44b19fdb1aa19cedbfc5df","schema_version":"1.0","event_id":"sha256:235d4a2d68c0fc3c1cc1a741993109fdd564a4d4bf44b19fdb1aa19cedbfc5df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3SRHSKW2CAAQLB5F5PBDFGLSNR/bundle.json","state_url":"https://pith.science/pith/3SRHSKW2CAAQLB5F5PBDFGLSNR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3SRHSKW2CAAQLB5F5PBDFGLSNR/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-05-27T02:28:21Z","links":{"resolver":"https://pith.science/pith/3SRHSKW2CAAQLB5F5PBDFGLSNR","bundle":"https://pith.science/pith/3SRHSKW2CAAQLB5F5PBDFGLSNR/bundle.json","state":"https://pith.science/pith/3SRHSKW2CAAQLB5F5PBDFGLSNR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3SRHSKW2CAAQLB5F5PBDFGLSNR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:3SRHSKW2CAAQLB5F5PBDFGLSNR","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":"89a7ccfa4e08846b41631525a68a88226445644dc12d5ba5d0286d5da64f733b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-13T15:59:58Z","title_canon_sha256":"b77b5e5ddef1de3c4a56c714b7996d32bb1fbb17fb4b2dec6fdf37512d38556a"},"schema_version":"1.0","source":{"id":"1112.2930","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.2930","created_at":"2026-05-18T04:06:20Z"},{"alias_kind":"arxiv_version","alias_value":"1112.2930v2","created_at":"2026-05-18T04:06:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2930","created_at":"2026-05-18T04:06:20Z"},{"alias_kind":"pith_short_12","alias_value":"3SRHSKW2CAAQ","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"3SRHSKW2CAAQLB5F","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"3SRHSKW2","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:235d4a2d68c0fc3c1cc1a741993109fdd564a4d4bf44b19fdb1aa19cedbfc5df","target":"graph","created_at":"2026-05-18T04:06:20Z","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":"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","authors_text":"Zachary Friggstad","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-13T15:59:58Z","title":"Multiple Traveling Salesmen in Asymmetric Metrics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.2930","kind":"arxiv","version":2},"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:957c63f9cada19eb4ac716307293b4052d3434c3095807692a2b769a1a0ca6ea","target":"record","created_at":"2026-05-18T04:06:20Z","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":"89a7ccfa4e08846b41631525a68a88226445644dc12d5ba5d0286d5da64f733b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-13T15:59:58Z","title_canon_sha256":"b77b5e5ddef1de3c4a56c714b7996d32bb1fbb17fb4b2dec6fdf37512d38556a"},"schema_version":"1.0","source":{"id":"1112.2930","kind":"arxiv","version":2}},"canonical_sha256":"dca2792ada10010587a5ebc23299726c640056ac892d5e7e935116e82211d5bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dca2792ada10010587a5ebc23299726c640056ac892d5e7e935116e82211d5bb","first_computed_at":"2026-05-18T04:06:20.337693Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:06:20.337693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"huPvdeLzqt5q3SMT0gnhk4K9dtJ7ngZo59HbmHQydlO3mEfa5oPUfdsv3oev0GRjjI2rxJGkqGCpMDblTOs2Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:06:20.338290Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.2930","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:957c63f9cada19eb4ac716307293b4052d3434c3095807692a2b769a1a0ca6ea","sha256:235d4a2d68c0fc3c1cc1a741993109fdd564a4d4bf44b19fdb1aa19cedbfc5df"],"state_sha256":"4870b559625d9b5006d4d5132002f6ee8d67fb954b494e508a2d4d50c3b848b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SQoUk1qlBTfkll21zqdWIyymdy+/3ZA21LjudA8hHG5CWK4GpqUjt5h9Z4PfaeMW0z08K0uRKD2w2YfxIOxyCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T02:28:21.439827Z","bundle_sha256":"2b8590ecddef37c99f4ae5e37dc1671462c1e9bf7a4b49b979da9c7f651e9502"}}