{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:4WIOWHJWU7BPI3CYTW6TFI5GZZ","short_pith_number":"pith:4WIOWHJW","schema_version":"1.0","canonical_sha256":"e590eb1d36a7c2f46c589dbd32a3a6ce73364c2650780edddc1d40b101f37474","source":{"kind":"arxiv","id":"2005.03186","version":1},"attestation_state":"computed","paper":{"title":"An Optimal Control Theory for the Traveling Salesman Problem and Its Variants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DM","cs.RO"],"primary_cat":"math.OC","authors_text":"I. M. Ross, M. Karpenko, R. J. Proulx","submitted_at":"2020-05-07T00:44:27Z","abstract_excerpt":"We show that the traveling salesman problem (TSP) and its many variants may be modeled as functional optimization problems over a graph. In this formulation, all vertices and arcs of the graph are functionals; i.e., a mapping from a space of measurable functions to the field of real numbers. Many variants of the TSP, such as those with neighborhoods, with forbidden neighborhoods, with time-windows and with profits, can all be framed under this construct. In sharp contrast to their discrete-optimization counterparts, the modeling constructs presented in this paper represent a fundamentally new "},"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":"2005.03186","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-05-07T00:44:27Z","cross_cats_sorted":["cs.AI","cs.DM","cs.RO"],"title_canon_sha256":"e4fc4581d4312a26ebd857bfb2c840a97559c2536e1c4101b1ae8435e1a05fad","abstract_canon_sha256":"0264853aa3ca396c23ade081d17c7bc69bdd2009f3b814b8532be4dd1916e624"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:01:06.018356Z","signature_b64":"GK3ZpyE3bspOF/LSDNUeJOxe1rHvOTrkNBcjCGOCGr7rA/Igh7gN9lftvfiYNJ35+ihrPtEMnicEvkdw6rKDBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e590eb1d36a7c2f46c589dbd32a3a6ce73364c2650780edddc1d40b101f37474","last_reissued_at":"2026-07-05T01:01:06.017670Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:01:06.017670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Optimal Control Theory for the Traveling Salesman Problem and Its Variants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DM","cs.RO"],"primary_cat":"math.OC","authors_text":"I. M. Ross, M. Karpenko, R. J. Proulx","submitted_at":"2020-05-07T00:44:27Z","abstract_excerpt":"We show that the traveling salesman problem (TSP) and its many variants may be modeled as functional optimization problems over a graph. In this formulation, all vertices and arcs of the graph are functionals; i.e., a mapping from a space of measurable functions to the field of real numbers. Many variants of the TSP, such as those with neighborhoods, with forbidden neighborhoods, with time-windows and with profits, can all be framed under this construct. In sharp contrast to their discrete-optimization counterparts, the modeling constructs presented in this paper represent a fundamentally new "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.03186","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/2005.03186/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":"2005.03186","created_at":"2026-07-05T01:01:06.017749+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.03186v1","created_at":"2026-07-05T01:01:06.017749+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.03186","created_at":"2026-07-05T01:01:06.017749+00:00"},{"alias_kind":"pith_short_12","alias_value":"4WIOWHJWU7BP","created_at":"2026-07-05T01:01:06.017749+00:00"},{"alias_kind":"pith_short_16","alias_value":"4WIOWHJWU7BPI3CY","created_at":"2026-07-05T01:01:06.017749+00:00"},{"alias_kind":"pith_short_8","alias_value":"4WIOWHJW","created_at":"2026-07-05T01:01:06.017749+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.01855","citing_title":"A Million-Point Fast Trajectory Optimization Solver","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4WIOWHJWU7BPI3CYTW6TFI5GZZ","json":"https://pith.science/pith/4WIOWHJWU7BPI3CYTW6TFI5GZZ.json","graph_json":"https://pith.science/api/pith-number/4WIOWHJWU7BPI3CYTW6TFI5GZZ/graph.json","events_json":"https://pith.science/api/pith-number/4WIOWHJWU7BPI3CYTW6TFI5GZZ/events.json","paper":"https://pith.science/paper/4WIOWHJW"},"agent_actions":{"view_html":"https://pith.science/pith/4WIOWHJWU7BPI3CYTW6TFI5GZZ","download_json":"https://pith.science/pith/4WIOWHJWU7BPI3CYTW6TFI5GZZ.json","view_paper":"https://pith.science/paper/4WIOWHJW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.03186&json=true","fetch_graph":"https://pith.science/api/pith-number/4WIOWHJWU7BPI3CYTW6TFI5GZZ/graph.json","fetch_events":"https://pith.science/api/pith-number/4WIOWHJWU7BPI3CYTW6TFI5GZZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4WIOWHJWU7BPI3CYTW6TFI5GZZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4WIOWHJWU7BPI3CYTW6TFI5GZZ/action/storage_attestation","attest_author":"https://pith.science/pith/4WIOWHJWU7BPI3CYTW6TFI5GZZ/action/author_attestation","sign_citation":"https://pith.science/pith/4WIOWHJWU7BPI3CYTW6TFI5GZZ/action/citation_signature","submit_replication":"https://pith.science/pith/4WIOWHJWU7BPI3CYTW6TFI5GZZ/action/replication_record"}},"created_at":"2026-07-05T01:01:06.017749+00:00","updated_at":"2026-07-05T01:01:06.017749+00:00"}