{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3JSDL6HUVMG5AZIXMZDVAQNU2Y","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":"9cbadfd1bc87ef6374af244ad1c8f255370d6ba062fe677411274f547bb9ef30","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-26T14:29:42Z","title_canon_sha256":"ea0c29502c7af3e2ff2fccb6834dfdacd17c6e8367b982b3e95453464de02898"},"schema_version":"1.0","source":{"id":"1803.09621","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.09621","created_at":"2026-05-17T23:53:55Z"},{"alias_kind":"arxiv_version","alias_value":"1803.09621v2","created_at":"2026-05-17T23:53:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09621","created_at":"2026-05-17T23:53:55Z"},{"alias_kind":"pith_short_12","alias_value":"3JSDL6HUVMG5","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3JSDL6HUVMG5AZIX","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3JSDL6HU","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:8025708523c7a8fa67bf8d86c51e8a7020d93344489a2ac5a67c092063caf3d2","target":"graph","created_at":"2026-05-17T23:53:55Z","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":"While there are optimal TSP solvers, as well as recent learning-based approaches, the generalization of the TSP to the Multiple Traveling Salesmen Problem is much less studied. Here, we design a neural network solution that treats the salesmen, cities and depot as three different sets of varying cardinalities. We apply a novel technique that combines elements from recent architectures that were developed for sets, as well as elements from graph networks. Coupled with new constraint enforcing output layers, a dedicated loss, and a search method, our solution is shown to outperform all the meta-","authors_text":"Lior Wolf, Yoav Kaempfer","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-26T14:29:42Z","title":"Learning the Multiple Traveling Salesmen Problem with Permutation Invariant Pooling Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09621","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:c3681e74e98cfd8f407bdd8ef6395df2426aa376389bd200e560e148a722fc9f","target":"record","created_at":"2026-05-17T23:53:55Z","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":"9cbadfd1bc87ef6374af244ad1c8f255370d6ba062fe677411274f547bb9ef30","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-26T14:29:42Z","title_canon_sha256":"ea0c29502c7af3e2ff2fccb6834dfdacd17c6e8367b982b3e95453464de02898"},"schema_version":"1.0","source":{"id":"1803.09621","kind":"arxiv","version":2}},"canonical_sha256":"da6435f8f4ab0dd0651766475041b4d6245be280fa8aaf5a2df54001a7215786","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da6435f8f4ab0dd0651766475041b4d6245be280fa8aaf5a2df54001a7215786","first_computed_at":"2026-05-17T23:53:55.820114Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:55.820114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D9MjDUbkjb+TL6scM6seEN6VcUHc5/Y7jaaZoi+d24wAqVm9c/XjG4Y1zVMWvXRPE3Cig1VXxEV3Za7MJNkqBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:55.820708Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.09621","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3681e74e98cfd8f407bdd8ef6395df2426aa376389bd200e560e148a722fc9f","sha256:8025708523c7a8fa67bf8d86c51e8a7020d93344489a2ac5a67c092063caf3d2"],"state_sha256":"f0e7448792f212be606b7f1b77bbb37a8635cc54a946a183e54476d46b0c7dc9"}