{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:4WIOWHJWU7BPI3CYTW6TFI5GZZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0264853aa3ca396c23ade081d17c7bc69bdd2009f3b814b8532be4dd1916e624","cross_cats_sorted":["cs.AI","cs.DM","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-05-07T00:44:27Z","title_canon_sha256":"e4fc4581d4312a26ebd857bfb2c840a97559c2536e1c4101b1ae8435e1a05fad"},"schema_version":"1.0","source":{"id":"2005.03186","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.03186","created_at":"2026-07-05T01:01:06Z"},{"alias_kind":"arxiv_version","alias_value":"2005.03186v1","created_at":"2026-07-05T01:01:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.03186","created_at":"2026-07-05T01:01:06Z"},{"alias_kind":"pith_short_12","alias_value":"4WIOWHJWU7BP","created_at":"2026-07-05T01:01:06Z"},{"alias_kind":"pith_short_16","alias_value":"4WIOWHJWU7BPI3CY","created_at":"2026-07-05T01:01:06Z"},{"alias_kind":"pith_short_8","alias_value":"4WIOWHJW","created_at":"2026-07-05T01:01:06Z"}],"graph_snapshots":[{"event_id":"sha256:a30622a0f43d5e10540cadd84ddb473b3f3fe9e82089e02b392f8cd30887726a","target":"graph","created_at":"2026-07-05T01:01:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2005.03186/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"I. M. Ross, M. Karpenko, R. J. Proulx","cross_cats":["cs.AI","cs.DM","cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-05-07T00:44:27Z","title":"An Optimal Control Theory for the Traveling Salesman Problem and Its Variants"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.03186","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f8f194b97598b831b3575b5cc51f7a6d7c6679aa3650525d8a45edcf5ae3bd41","target":"record","created_at":"2026-07-05T01:01:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0264853aa3ca396c23ade081d17c7bc69bdd2009f3b814b8532be4dd1916e624","cross_cats_sorted":["cs.AI","cs.DM","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-05-07T00:44:27Z","title_canon_sha256":"e4fc4581d4312a26ebd857bfb2c840a97559c2536e1c4101b1ae8435e1a05fad"},"schema_version":"1.0","source":{"id":"2005.03186","kind":"arxiv","version":1}},"canonical_sha256":"e590eb1d36a7c2f46c589dbd32a3a6ce73364c2650780edddc1d40b101f37474","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e590eb1d36a7c2f46c589dbd32a3a6ce73364c2650780edddc1d40b101f37474","first_computed_at":"2026-07-05T01:01:06.017670Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:01:06.017670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GK3ZpyE3bspOF/LSDNUeJOxe1rHvOTrkNBcjCGOCGr7rA/Igh7gN9lftvfiYNJ35+ihrPtEMnicEvkdw6rKDBw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:01:06.018356Z","signed_message":"canonical_sha256_bytes"},"source_id":"2005.03186","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8f194b97598b831b3575b5cc51f7a6d7c6679aa3650525d8a45edcf5ae3bd41","sha256:a30622a0f43d5e10540cadd84ddb473b3f3fe9e82089e02b392f8cd30887726a"],"state_sha256":"ef8a844983e57eb2fcb8f1b409450cbc912ba23bfa32dbb84c996ab35b5e615b"}