{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:4WPVLA6A3ETVPXCUHI3BYJZYPP","short_pith_number":"pith:4WPVLA6A","schema_version":"1.0","canonical_sha256":"e59f5583c0d92757dc543a361c27387bedca07cd76de6f43c104411744614fd2","source":{"kind":"arxiv","id":"2305.01883","version":2},"attestation_state":"computed","paper":{"title":"A Lightweight CNN-Transformer Model for Learning Traveling Salesman Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.LG","authors_text":"Jaeseung Lee, Jibum Kim, Minseop Jung","submitted_at":"2023-05-03T04:28:10Z","abstract_excerpt":"Several studies have attempted to solve traveling salesman problems (TSPs) using various deep learning techniques. Among them, Transformer-based models show state-of-the-art performance even for large-scale Traveling Salesman Problems (TSPs). However, they are based on fully-connected attention models and suffer from large computational complexity and GPU memory usage. Our work is the first CNN-Transformer model based on a CNN embedding layer and partial self-attention for TSP. Our CNN-Transformer model is able to better learn spatial features from input data using a CNN embedding layer compar"},"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":"2305.01883","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-05-03T04:28:10Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"4d665ab3cb08d0c916620ed83321f8a2f1e2b005b9f25e3c7fdb5b2ed40f8c04","abstract_canon_sha256":"fac01246a8b78b05e8b97baf9a319be6bf66bfc46f8c2fb64f4698139e5e614c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:52:40.164062Z","signature_b64":"DWkkgjlwzCtI1usH1A2S0cWUKkvBK1arwKu5DRGChF7MFrdmZGEinJdjYfab4+5n4Lqjxguh6wglv8H8wy4jBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e59f5583c0d92757dc543a361c27387bedca07cd76de6f43c104411744614fd2","last_reissued_at":"2026-07-05T07:52:40.163521Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:52:40.163521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Lightweight CNN-Transformer Model for Learning Traveling Salesman Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.LG","authors_text":"Jaeseung Lee, Jibum Kim, Minseop Jung","submitted_at":"2023-05-03T04:28:10Z","abstract_excerpt":"Several studies have attempted to solve traveling salesman problems (TSPs) using various deep learning techniques. Among them, Transformer-based models show state-of-the-art performance even for large-scale Traveling Salesman Problems (TSPs). However, they are based on fully-connected attention models and suffer from large computational complexity and GPU memory usage. Our work is the first CNN-Transformer model based on a CNN embedding layer and partial self-attention for TSP. Our CNN-Transformer model is able to better learn spatial features from input data using a CNN embedding layer compar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.01883","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2305.01883/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":"2305.01883","created_at":"2026-07-05T07:52:40.163602+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.01883v2","created_at":"2026-07-05T07:52:40.163602+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.01883","created_at":"2026-07-05T07:52:40.163602+00:00"},{"alias_kind":"pith_short_12","alias_value":"4WPVLA6A3ETV","created_at":"2026-07-05T07:52:40.163602+00:00"},{"alias_kind":"pith_short_16","alias_value":"4WPVLA6A3ETVPXCU","created_at":"2026-07-05T07:52:40.163602+00:00"},{"alias_kind":"pith_short_8","alias_value":"4WPVLA6A","created_at":"2026-07-05T07:52:40.163602+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.13767","citing_title":"An Efficient Diffusion-based Non-Autoregressive Solver for Traveling Salesman Problem","ref_index":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4WPVLA6A3ETVPXCUHI3BYJZYPP","json":"https://pith.science/pith/4WPVLA6A3ETVPXCUHI3BYJZYPP.json","graph_json":"https://pith.science/api/pith-number/4WPVLA6A3ETVPXCUHI3BYJZYPP/graph.json","events_json":"https://pith.science/api/pith-number/4WPVLA6A3ETVPXCUHI3BYJZYPP/events.json","paper":"https://pith.science/paper/4WPVLA6A"},"agent_actions":{"view_html":"https://pith.science/pith/4WPVLA6A3ETVPXCUHI3BYJZYPP","download_json":"https://pith.science/pith/4WPVLA6A3ETVPXCUHI3BYJZYPP.json","view_paper":"https://pith.science/paper/4WPVLA6A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.01883&json=true","fetch_graph":"https://pith.science/api/pith-number/4WPVLA6A3ETVPXCUHI3BYJZYPP/graph.json","fetch_events":"https://pith.science/api/pith-number/4WPVLA6A3ETVPXCUHI3BYJZYPP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4WPVLA6A3ETVPXCUHI3BYJZYPP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4WPVLA6A3ETVPXCUHI3BYJZYPP/action/storage_attestation","attest_author":"https://pith.science/pith/4WPVLA6A3ETVPXCUHI3BYJZYPP/action/author_attestation","sign_citation":"https://pith.science/pith/4WPVLA6A3ETVPXCUHI3BYJZYPP/action/citation_signature","submit_replication":"https://pith.science/pith/4WPVLA6A3ETVPXCUHI3BYJZYPP/action/replication_record"}},"created_at":"2026-07-05T07:52:40.163602+00:00","updated_at":"2026-07-05T07:52:40.163602+00:00"}