{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:BYQSGHUPODZ4ZCESMRIAKIR6CB","short_pith_number":"pith:BYQSGHUP","schema_version":"1.0","canonical_sha256":"0e21231e8f70f3cc8892645005223e106bd55448ebf6804ad596b0b7d9ad6405","source":{"kind":"arxiv","id":"2204.03236","version":1},"attestation_state":"computed","paper":{"title":"Learning to Solve Travelling Salesman Problem with Hardness-adaptive Curriculum","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Wenwu Zhu, Xin Wang, Zeyang Zhang, Ziwei Zhang","submitted_at":"2022-04-07T05:59:05Z","abstract_excerpt":"Various neural network models have been proposed to tackle combinatorial optimization problems such as the travelling salesman problem (TSP). Existing learning-based TSP methods adopt a simple setting that the training and testing data are independent and identically distributed. However, the existing literature fails to solve TSP instances when training and testing data have different distributions. Concretely, we find that different training and testing distribution will result in more difficult TSP instances, i.e., the solution obtained by the model has a large gap from the optimal solution"},"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":"2204.03236","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2022-04-07T05:59:05Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"549dc750a2b02a35fa3cd56e770d163c83e34b1a2da6c0808a9ee5d6854031c1","abstract_canon_sha256":"ec3efcf192316464e32cf8a50a758fee97f928ec3941af1c7772d002cc3ca64f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:12:21.200527Z","signature_b64":"5ekFrVv3Ty2II2Y1ndWHoilOIjtYQ59yZqEsaGl3MbbMVXKN/2iU8ScMZz7vjQH/6k1FBaOSOvqYobwSug7CDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e21231e8f70f3cc8892645005223e106bd55448ebf6804ad596b0b7d9ad6405","last_reissued_at":"2026-07-05T04:12:21.200074Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:12:21.200074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Solve Travelling Salesman Problem with Hardness-adaptive Curriculum","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Wenwu Zhu, Xin Wang, Zeyang Zhang, Ziwei Zhang","submitted_at":"2022-04-07T05:59:05Z","abstract_excerpt":"Various neural network models have been proposed to tackle combinatorial optimization problems such as the travelling salesman problem (TSP). Existing learning-based TSP methods adopt a simple setting that the training and testing data are independent and identically distributed. However, the existing literature fails to solve TSP instances when training and testing data have different distributions. Concretely, we find that different training and testing distribution will result in more difficult TSP instances, i.e., the solution obtained by the model has a large gap from the optimal solution"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.03236","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/2204.03236/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":"2204.03236","created_at":"2026-07-05T04:12:21.200129+00:00"},{"alias_kind":"arxiv_version","alias_value":"2204.03236v1","created_at":"2026-07-05T04:12:21.200129+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.03236","created_at":"2026-07-05T04:12:21.200129+00:00"},{"alias_kind":"pith_short_12","alias_value":"BYQSGHUPODZ4","created_at":"2026-07-05T04:12:21.200129+00:00"},{"alias_kind":"pith_short_16","alias_value":"BYQSGHUPODZ4ZCES","created_at":"2026-07-05T04:12:21.200129+00:00"},{"alias_kind":"pith_short_8","alias_value":"BYQSGHUP","created_at":"2026-07-05T04:12:21.200129+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2601.01665","citing_title":"Adversarial Instance Generation and Robust Training for Neural Combinatorial Optimization with Multiple Objectives","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BYQSGHUPODZ4ZCESMRIAKIR6CB","json":"https://pith.science/pith/BYQSGHUPODZ4ZCESMRIAKIR6CB.json","graph_json":"https://pith.science/api/pith-number/BYQSGHUPODZ4ZCESMRIAKIR6CB/graph.json","events_json":"https://pith.science/api/pith-number/BYQSGHUPODZ4ZCESMRIAKIR6CB/events.json","paper":"https://pith.science/paper/BYQSGHUP"},"agent_actions":{"view_html":"https://pith.science/pith/BYQSGHUPODZ4ZCESMRIAKIR6CB","download_json":"https://pith.science/pith/BYQSGHUPODZ4ZCESMRIAKIR6CB.json","view_paper":"https://pith.science/paper/BYQSGHUP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2204.03236&json=true","fetch_graph":"https://pith.science/api/pith-number/BYQSGHUPODZ4ZCESMRIAKIR6CB/graph.json","fetch_events":"https://pith.science/api/pith-number/BYQSGHUPODZ4ZCESMRIAKIR6CB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BYQSGHUPODZ4ZCESMRIAKIR6CB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BYQSGHUPODZ4ZCESMRIAKIR6CB/action/storage_attestation","attest_author":"https://pith.science/pith/BYQSGHUPODZ4ZCESMRIAKIR6CB/action/author_attestation","sign_citation":"https://pith.science/pith/BYQSGHUPODZ4ZCESMRIAKIR6CB/action/citation_signature","submit_replication":"https://pith.science/pith/BYQSGHUPODZ4ZCESMRIAKIR6CB/action/replication_record"}},"created_at":"2026-07-05T04:12:21.200129+00:00","updated_at":"2026-07-05T04:12:21.200129+00:00"}