{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:CXKUCTZDWQC5TITG7IJ7R7QOWN","short_pith_number":"pith:CXKUCTZD","schema_version":"1.0","canonical_sha256":"15d5414f23b405d9a266fa13f8fe0eb37414c2e77ba453f4f22e9dc6d2129501","source":{"kind":"arxiv","id":"2203.01298","version":3},"attestation_state":"computed","paper":{"title":"Pareto Frontier Approximation Network (PA-Net) to Solve Bi-objective TSP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Ishaan Mehta, Sajad Saeedi, Sharareh Taghipour","submitted_at":"2022-03-02T18:25:45Z","abstract_excerpt":"The travelling salesperson problem (TSP) is a classic resource allocation problem used to find an optimal order of doing a set of tasks while minimizing (or maximizing) an associated objective function. It is widely used in robotics for applications such as planning and scheduling. In this work, we solve TSP for two objectives using reinforcement learning (RL). Often in multi-objective optimization problems, the associated objective functions can be conflicting in nature. In such cases, the optimality is defined in terms of Pareto optimality. A set of these Pareto optimal solutions in the obje"},"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":"2203.01298","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-03-02T18:25:45Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"e62ac76c865cc7c7364f7cf1186bb3f771df873b0862588456a2ea8cca033386","abstract_canon_sha256":"1682769edfde958650d2497a13b658a4583f2afb28a50c37d80ad8c183431943"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:40:50.935213Z","signature_b64":"kDoRE9Ynf3/+kgMIHqqElF9WN4IP7MzhL4VcrDa71lhTTx75rSJgWV+XvP4uOQUNMqiUfQmri8+tej9a4DuODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15d5414f23b405d9a266fa13f8fe0eb37414c2e77ba453f4f22e9dc6d2129501","last_reissued_at":"2026-07-05T04:40:50.934804Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:40:50.934804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pareto Frontier Approximation Network (PA-Net) to Solve Bi-objective TSP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Ishaan Mehta, Sajad Saeedi, Sharareh Taghipour","submitted_at":"2022-03-02T18:25:45Z","abstract_excerpt":"The travelling salesperson problem (TSP) is a classic resource allocation problem used to find an optimal order of doing a set of tasks while minimizing (or maximizing) an associated objective function. It is widely used in robotics for applications such as planning and scheduling. In this work, we solve TSP for two objectives using reinforcement learning (RL). Often in multi-objective optimization problems, the associated objective functions can be conflicting in nature. In such cases, the optimality is defined in terms of Pareto optimality. A set of these Pareto optimal solutions in the obje"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.01298","kind":"arxiv","version":3},"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/2203.01298/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":"2203.01298","created_at":"2026-07-05T04:40:50.934860+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.01298v3","created_at":"2026-07-05T04:40:50.934860+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.01298","created_at":"2026-07-05T04:40:50.934860+00:00"},{"alias_kind":"pith_short_12","alias_value":"CXKUCTZDWQC5","created_at":"2026-07-05T04:40:50.934860+00:00"},{"alias_kind":"pith_short_16","alias_value":"CXKUCTZDWQC5TITG","created_at":"2026-07-05T04:40:50.934860+00:00"},{"alias_kind":"pith_short_8","alias_value":"CXKUCTZD","created_at":"2026-07-05T04:40:50.934860+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.21604","citing_title":"Learning to Place Guards by Reinforcement: A Geo-Free Neural Policy for the Vertex-Guard Art Gallery Problem","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CXKUCTZDWQC5TITG7IJ7R7QOWN","json":"https://pith.science/pith/CXKUCTZDWQC5TITG7IJ7R7QOWN.json","graph_json":"https://pith.science/api/pith-number/CXKUCTZDWQC5TITG7IJ7R7QOWN/graph.json","events_json":"https://pith.science/api/pith-number/CXKUCTZDWQC5TITG7IJ7R7QOWN/events.json","paper":"https://pith.science/paper/CXKUCTZD"},"agent_actions":{"view_html":"https://pith.science/pith/CXKUCTZDWQC5TITG7IJ7R7QOWN","download_json":"https://pith.science/pith/CXKUCTZDWQC5TITG7IJ7R7QOWN.json","view_paper":"https://pith.science/paper/CXKUCTZD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.01298&json=true","fetch_graph":"https://pith.science/api/pith-number/CXKUCTZDWQC5TITG7IJ7R7QOWN/graph.json","fetch_events":"https://pith.science/api/pith-number/CXKUCTZDWQC5TITG7IJ7R7QOWN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CXKUCTZDWQC5TITG7IJ7R7QOWN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CXKUCTZDWQC5TITG7IJ7R7QOWN/action/storage_attestation","attest_author":"https://pith.science/pith/CXKUCTZDWQC5TITG7IJ7R7QOWN/action/author_attestation","sign_citation":"https://pith.science/pith/CXKUCTZDWQC5TITG7IJ7R7QOWN/action/citation_signature","submit_replication":"https://pith.science/pith/CXKUCTZDWQC5TITG7IJ7R7QOWN/action/replication_record"}},"created_at":"2026-07-05T04:40:50.934860+00:00","updated_at":"2026-07-05T04:40:50.934860+00:00"}