{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:Y6GA573M766ACGFLPNLFWBHI3H","short_pith_number":"pith:Y6GA573M","schema_version":"1.0","canonical_sha256":"c78c0eff6cffbc0118ab7b565b04e8d9d53cfaab6c752ee09070f274e645b2e3","source":{"kind":"arxiv","id":"1509.02459","version":1},"attestation_state":"computed","paper":{"title":"Evolving TSP heuristics using Multi Expression Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.AI","authors_text":"D. Dumitrescu, Mihai Oltean","submitted_at":"2015-09-08T17:37:01Z","abstract_excerpt":"Multi Expression Programming (MEP) is an evolutionary technique that may be used for solving computationally difficult problems. MEP uses a linear solution representation. Each MEP individual is a string encoding complex expressions (computer programs). A MEP individual may encode multiple solutions of the current problem. In this paper MEP is used for evolving a Traveling Salesman Problem (TSP) heuristic for graphs satisfying triangle inequality. Evolved MEP heuristic is compared with Nearest Neighbor Heuristic (NN) and Minimum Spanning Tree Heuristic (MST) on some difficult problems in TSPLI"},"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":"1509.02459","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-09-08T17:37:01Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"65d451b294a446b2c31ed829ebd4f6bf2b5dcd73e467217c9f2ef3443b99a90b","abstract_canon_sha256":"5e5586807c38c506f80d6a439a55007d64125829bcf25008e78d2da1f682f7ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:40.848556Z","signature_b64":"mZ7FXFyR3d+C842mCFsguBCrd4Ure8wQaFBQZ7vmD5o4AsnAMI6NaWlUEgrcxTRvPsWvzXCkXEHw9d/zdK1vCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c78c0eff6cffbc0118ab7b565b04e8d9d53cfaab6c752ee09070f274e645b2e3","last_reissued_at":"2026-05-18T01:33:40.848106Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:40.848106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Evolving TSP heuristics using Multi Expression Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.AI","authors_text":"D. Dumitrescu, Mihai Oltean","submitted_at":"2015-09-08T17:37:01Z","abstract_excerpt":"Multi Expression Programming (MEP) is an evolutionary technique that may be used for solving computationally difficult problems. MEP uses a linear solution representation. Each MEP individual is a string encoding complex expressions (computer programs). A MEP individual may encode multiple solutions of the current problem. In this paper MEP is used for evolving a Traveling Salesman Problem (TSP) heuristic for graphs satisfying triangle inequality. Evolved MEP heuristic is compared with Nearest Neighbor Heuristic (NN) and Minimum Spanning Tree Heuristic (MST) on some difficult problems in TSPLI"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02459","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":""},"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":"1509.02459","created_at":"2026-05-18T01:33:40.848193+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.02459v1","created_at":"2026-05-18T01:33:40.848193+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02459","created_at":"2026-05-18T01:33:40.848193+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y6GA573M766A","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y6GA573M766ACGFL","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y6GA573M","created_at":"2026-05-18T12:29:50.041715+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y6GA573M766ACGFLPNLFWBHI3H","json":"https://pith.science/pith/Y6GA573M766ACGFLPNLFWBHI3H.json","graph_json":"https://pith.science/api/pith-number/Y6GA573M766ACGFLPNLFWBHI3H/graph.json","events_json":"https://pith.science/api/pith-number/Y6GA573M766ACGFLPNLFWBHI3H/events.json","paper":"https://pith.science/paper/Y6GA573M"},"agent_actions":{"view_html":"https://pith.science/pith/Y6GA573M766ACGFLPNLFWBHI3H","download_json":"https://pith.science/pith/Y6GA573M766ACGFLPNLFWBHI3H.json","view_paper":"https://pith.science/paper/Y6GA573M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.02459&json=true","fetch_graph":"https://pith.science/api/pith-number/Y6GA573M766ACGFLPNLFWBHI3H/graph.json","fetch_events":"https://pith.science/api/pith-number/Y6GA573M766ACGFLPNLFWBHI3H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y6GA573M766ACGFLPNLFWBHI3H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y6GA573M766ACGFLPNLFWBHI3H/action/storage_attestation","attest_author":"https://pith.science/pith/Y6GA573M766ACGFLPNLFWBHI3H/action/author_attestation","sign_citation":"https://pith.science/pith/Y6GA573M766ACGFLPNLFWBHI3H/action/citation_signature","submit_replication":"https://pith.science/pith/Y6GA573M766ACGFLPNLFWBHI3H/action/replication_record"}},"created_at":"2026-05-18T01:33:40.848193+00:00","updated_at":"2026-05-18T01:33:40.848193+00:00"}