{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:EGZUYVMPYJL7OCOMG44JGDKQMK","short_pith_number":"pith:EGZUYVMP","schema_version":"1.0","canonical_sha256":"21b34c558fc257f709cc3738930d5062859c3f927c62a2424d4c9740e41d3aef","source":{"kind":"arxiv","id":"2102.05875","version":1},"attestation_state":"computed","paper":{"title":"Deep Reinforcement Learning for Combinatorial Optimization: Covering Salesman Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NE","authors_text":"Kaiwen Li, Rui Wang Yuheng Wang, Tao Zhang, Yi Han","submitted_at":"2021-02-11T07:25:04Z","abstract_excerpt":"This paper introduces a new deep learning approach to approximately solve the Covering Salesman Problem (CSP). In this approach, given the city locations of a CSP as input, a deep neural network model is designed to directly output the solution. It is trained using the deep reinforcement learning without supervision. Specifically, in the model, we apply the Multi-head Attention to capture the structural patterns, and design a dynamic embedding to handle the dynamic patterns of the problem. Once the model is trained, it can generalize to various types of CSP tasks (different sizes and topologie"},"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":"2102.05875","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2021-02-11T07:25:04Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"8ffca89f9b8c3f6a1e1923bf0abcd9bab109ed6bc23f08197d5800d2b5fdc892","abstract_canon_sha256":"f792cb5f9305d6281afac0953a0c55860fc55476981ca6fcf96e19f8f4ecda22"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:14:10.592566Z","signature_b64":"A01l7mxeyc8re3udY9ZiI4ShDvaFYXUnpadH6KmSjN2/aNTwjf6T8zVaHanWtjxJXphxmNfFxZjQ7DqDoWM5CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21b34c558fc257f709cc3738930d5062859c3f927c62a2424d4c9740e41d3aef","last_reissued_at":"2026-07-05T03:14:10.592056Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:14:10.592056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Reinforcement Learning for Combinatorial Optimization: Covering Salesman Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NE","authors_text":"Kaiwen Li, Rui Wang Yuheng Wang, Tao Zhang, Yi Han","submitted_at":"2021-02-11T07:25:04Z","abstract_excerpt":"This paper introduces a new deep learning approach to approximately solve the Covering Salesman Problem (CSP). In this approach, given the city locations of a CSP as input, a deep neural network model is designed to directly output the solution. It is trained using the deep reinforcement learning without supervision. Specifically, in the model, we apply the Multi-head Attention to capture the structural patterns, and design a dynamic embedding to handle the dynamic patterns of the problem. Once the model is trained, it can generalize to various types of CSP tasks (different sizes and topologie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.05875","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2102.05875/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2102.05875","created_at":"2026-07-05T03:14:10.592125+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.05875v1","created_at":"2026-07-05T03:14:10.592125+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.05875","created_at":"2026-07-05T03:14:10.592125+00:00"},{"alias_kind":"pith_short_12","alias_value":"EGZUYVMPYJL7","created_at":"2026-07-05T03:14:10.592125+00:00"},{"alias_kind":"pith_short_16","alias_value":"EGZUYVMPYJL7OCOM","created_at":"2026-07-05T03:14:10.592125+00:00"},{"alias_kind":"pith_short_8","alias_value":"EGZUYVMP","created_at":"2026-07-05T03:14:10.592125+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/EGZUYVMPYJL7OCOMG44JGDKQMK","json":"https://pith.science/pith/EGZUYVMPYJL7OCOMG44JGDKQMK.json","graph_json":"https://pith.science/api/pith-number/EGZUYVMPYJL7OCOMG44JGDKQMK/graph.json","events_json":"https://pith.science/api/pith-number/EGZUYVMPYJL7OCOMG44JGDKQMK/events.json","paper":"https://pith.science/paper/EGZUYVMP"},"agent_actions":{"view_html":"https://pith.science/pith/EGZUYVMPYJL7OCOMG44JGDKQMK","download_json":"https://pith.science/pith/EGZUYVMPYJL7OCOMG44JGDKQMK.json","view_paper":"https://pith.science/paper/EGZUYVMP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.05875&json=true","fetch_graph":"https://pith.science/api/pith-number/EGZUYVMPYJL7OCOMG44JGDKQMK/graph.json","fetch_events":"https://pith.science/api/pith-number/EGZUYVMPYJL7OCOMG44JGDKQMK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EGZUYVMPYJL7OCOMG44JGDKQMK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EGZUYVMPYJL7OCOMG44JGDKQMK/action/storage_attestation","attest_author":"https://pith.science/pith/EGZUYVMPYJL7OCOMG44JGDKQMK/action/author_attestation","sign_citation":"https://pith.science/pith/EGZUYVMPYJL7OCOMG44JGDKQMK/action/citation_signature","submit_replication":"https://pith.science/pith/EGZUYVMPYJL7OCOMG44JGDKQMK/action/replication_record"}},"created_at":"2026-07-05T03:14:10.592125+00:00","updated_at":"2026-07-05T03:14:10.592125+00:00"}