{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3JSDL6HUVMG5AZIXMZDVAQNU2Y","short_pith_number":"pith:3JSDL6HU","schema_version":"1.0","canonical_sha256":"da6435f8f4ab0dd0651766475041b4d6245be280fa8aaf5a2df54001a7215786","source":{"kind":"arxiv","id":"1803.09621","version":2},"attestation_state":"computed","paper":{"title":"Learning the Multiple Traveling Salesmen Problem with Permutation Invariant Pooling Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Lior Wolf, Yoav Kaempfer","submitted_at":"2018-03-26T14:29:42Z","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-"},"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":"1803.09621","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-26T14:29:42Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ea0c29502c7af3e2ff2fccb6834dfdacd17c6e8367b982b3e95453464de02898","abstract_canon_sha256":"9cbadfd1bc87ef6374af244ad1c8f255370d6ba062fe677411274f547bb9ef30"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:55.820708Z","signature_b64":"D9MjDUbkjb+TL6scM6seEN6VcUHc5/Y7jaaZoi+d24wAqVm9c/XjG4Y1zVMWvXRPE3Cig1VXxEV3Za7MJNkqBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da6435f8f4ab0dd0651766475041b4d6245be280fa8aaf5a2df54001a7215786","last_reissued_at":"2026-05-17T23:53:55.820114Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:55.820114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning the Multiple Traveling Salesmen Problem with Permutation Invariant Pooling Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Lior Wolf, Yoav Kaempfer","submitted_at":"2018-03-26T14:29:42Z","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-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09621","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":"1803.09621","created_at":"2026-05-17T23:53:55.820203+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.09621v2","created_at":"2026-05-17T23:53:55.820203+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09621","created_at":"2026-05-17T23:53:55.820203+00:00"},{"alias_kind":"pith_short_12","alias_value":"3JSDL6HUVMG5","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"3JSDL6HUVMG5AZIX","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"3JSDL6HU","created_at":"2026-05-18T12:32:02.567920+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.02666","citing_title":"Deep Reinforcement Learning Enabled Persistent Surveillance with Energy-Aware UAV-UGV Systems for Disaster Management Applications","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3JSDL6HUVMG5AZIXMZDVAQNU2Y","json":"https://pith.science/pith/3JSDL6HUVMG5AZIXMZDVAQNU2Y.json","graph_json":"https://pith.science/api/pith-number/3JSDL6HUVMG5AZIXMZDVAQNU2Y/graph.json","events_json":"https://pith.science/api/pith-number/3JSDL6HUVMG5AZIXMZDVAQNU2Y/events.json","paper":"https://pith.science/paper/3JSDL6HU"},"agent_actions":{"view_html":"https://pith.science/pith/3JSDL6HUVMG5AZIXMZDVAQNU2Y","download_json":"https://pith.science/pith/3JSDL6HUVMG5AZIXMZDVAQNU2Y.json","view_paper":"https://pith.science/paper/3JSDL6HU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.09621&json=true","fetch_graph":"https://pith.science/api/pith-number/3JSDL6HUVMG5AZIXMZDVAQNU2Y/graph.json","fetch_events":"https://pith.science/api/pith-number/3JSDL6HUVMG5AZIXMZDVAQNU2Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3JSDL6HUVMG5AZIXMZDVAQNU2Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3JSDL6HUVMG5AZIXMZDVAQNU2Y/action/storage_attestation","attest_author":"https://pith.science/pith/3JSDL6HUVMG5AZIXMZDVAQNU2Y/action/author_attestation","sign_citation":"https://pith.science/pith/3JSDL6HUVMG5AZIXMZDVAQNU2Y/action/citation_signature","submit_replication":"https://pith.science/pith/3JSDL6HUVMG5AZIXMZDVAQNU2Y/action/replication_record"}},"created_at":"2026-05-17T23:53:55.820203+00:00","updated_at":"2026-05-17T23:53:55.820203+00:00"}