{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:Y6GA573M766ACGFLPNLFWBHI3H","short_pith_number":"pith:Y6GA573M","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"},"canonical_sha256":"c78c0eff6cffbc0118ab7b565b04e8d9d53cfaab6c752ee09070f274e645b2e3","source":{"kind":"arxiv","id":"1509.02459","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.02459","created_at":"2026-05-18T01:33:40Z"},{"alias_kind":"arxiv_version","alias_value":"1509.02459v1","created_at":"2026-05-18T01:33:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02459","created_at":"2026-05-18T01:33:40Z"},{"alias_kind":"pith_short_12","alias_value":"Y6GA573M766A","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"Y6GA573M766ACGFL","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"Y6GA573M","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:Y6GA573M766ACGFLPNLFWBHI3H","target":"record","payload":{"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"},"canonical_sha256":"c78c0eff6cffbc0118ab7b565b04e8d9d53cfaab6c752ee09070f274e645b2e3","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"},"source_kind":"arxiv","source_id":"1509.02459","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:33:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V91wnUTEw6wWHPQDT2tXD30XlSK4qRWYVrrHAC1cyFF0XhZOPgNCm/fdH344Iwk+0Z4/K4fiq0NLxGItAgpYBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T21:04:24.033893Z"},"content_sha256":"2c0576e1f1242445f77c9775dbd7a40a1c0a3890699a4ac2f9aa150ae78fcfe3","schema_version":"1.0","event_id":"sha256:2c0576e1f1242445f77c9775dbd7a40a1c0a3890699a4ac2f9aa150ae78fcfe3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:Y6GA573M766ACGFLPNLFWBHI3H","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:33:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VxPXL8zhlQNcSwyhUi9ZQwdlnNBLgPTrFmwu6gRJcaltSwligB7cwPYZbBS1kvaDj0RiDt88oF5Lu+dQN8k1Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T21:04:24.034241Z"},"content_sha256":"ea59f9e97dbc15502d255758d1ab85bd84e92f2f8136d02d5f75c897f06fc6fc","schema_version":"1.0","event_id":"sha256:ea59f9e97dbc15502d255758d1ab85bd84e92f2f8136d02d5f75c897f06fc6fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y6GA573M766ACGFLPNLFWBHI3H/bundle.json","state_url":"https://pith.science/pith/Y6GA573M766ACGFLPNLFWBHI3H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y6GA573M766ACGFLPNLFWBHI3H/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-24T21:04:24Z","links":{"resolver":"https://pith.science/pith/Y6GA573M766ACGFLPNLFWBHI3H","bundle":"https://pith.science/pith/Y6GA573M766ACGFLPNLFWBHI3H/bundle.json","state":"https://pith.science/pith/Y6GA573M766ACGFLPNLFWBHI3H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y6GA573M766ACGFLPNLFWBHI3H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:Y6GA573M766ACGFLPNLFWBHI3H","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":"5e5586807c38c506f80d6a439a55007d64125829bcf25008e78d2da1f682f7ef","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-09-08T17:37:01Z","title_canon_sha256":"65d451b294a446b2c31ed829ebd4f6bf2b5dcd73e467217c9f2ef3443b99a90b"},"schema_version":"1.0","source":{"id":"1509.02459","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.02459","created_at":"2026-05-18T01:33:40Z"},{"alias_kind":"arxiv_version","alias_value":"1509.02459v1","created_at":"2026-05-18T01:33:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02459","created_at":"2026-05-18T01:33:40Z"},{"alias_kind":"pith_short_12","alias_value":"Y6GA573M766A","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"Y6GA573M766ACGFL","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"Y6GA573M","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:ea59f9e97dbc15502d255758d1ab85bd84e92f2f8136d02d5f75c897f06fc6fc","target":"graph","created_at":"2026-05-18T01:33:40Z","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"},"paper":{"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","authors_text":"D. Dumitrescu, Mihai Oltean","cross_cats":["cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-09-08T17:37:01Z","title":"Evolving TSP heuristics using Multi Expression Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02459","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:2c0576e1f1242445f77c9775dbd7a40a1c0a3890699a4ac2f9aa150ae78fcfe3","target":"record","created_at":"2026-05-18T01:33:40Z","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":"5e5586807c38c506f80d6a439a55007d64125829bcf25008e78d2da1f682f7ef","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-09-08T17:37:01Z","title_canon_sha256":"65d451b294a446b2c31ed829ebd4f6bf2b5dcd73e467217c9f2ef3443b99a90b"},"schema_version":"1.0","source":{"id":"1509.02459","kind":"arxiv","version":1}},"canonical_sha256":"c78c0eff6cffbc0118ab7b565b04e8d9d53cfaab6c752ee09070f274e645b2e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c78c0eff6cffbc0118ab7b565b04e8d9d53cfaab6c752ee09070f274e645b2e3","first_computed_at":"2026-05-18T01:33:40.848106Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:40.848106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mZ7FXFyR3d+C842mCFsguBCrd4Ure8wQaFBQZ7vmD5o4AsnAMI6NaWlUEgrcxTRvPsWvzXCkXEHw9d/zdK1vCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:40.848556Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.02459","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c0576e1f1242445f77c9775dbd7a40a1c0a3890699a4ac2f9aa150ae78fcfe3","sha256:ea59f9e97dbc15502d255758d1ab85bd84e92f2f8136d02d5f75c897f06fc6fc"],"state_sha256":"7871e0982f89ede1dce621d8c838afce4519da1682aa27f7af73a59e9ba41bb0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rkdqPkcsnqHwwXRuU4LX160WAK4QZ9hVsZdI5maZdcH01r2PPL/4SQ7mKjYjgz/pYHiG7A0HUBXvXgcT436XAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T21:04:24.036217Z","bundle_sha256":"018d71b5081ea4725e20030a4af6fe0895467fb44cd1a5f57059816ba34dddaf"}}