{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3FKIDXCUOYEUMHM5LBL4KOKG37","short_pith_number":"pith:3FKIDXCU","schema_version":"1.0","canonical_sha256":"d95481dc547609461d9d5857c53946dfee28c5eb15c2b589dfc701b89464eabe","source":{"kind":"arxiv","id":"1802.02434","version":1},"attestation_state":"computed","paper":{"title":"Evolutionary Computation plus Dynamic Programming for the Bi-Objective Travelling Thief Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Frank Neumann, Junhua Wu, Markus Wagner, Sergey Polyakovskiy","submitted_at":"2018-02-07T14:34:53Z","abstract_excerpt":"This research proposes a novel indicator-based hybrid evolutionary approach that combines approximate and exact algorithms. We apply it to a new bi-criteria formulation of the travelling thief problem, which is known to the Evolutionary Computation community as a benchmark multi-component optimisation problem that interconnects two classical NP-hard problems: the travelling salesman problem and the 0-1 knapsack problem. Our approach employs the exact dynamic programming algorithm for the underlying Packing-While-Travelling (PWT) problem as a subroutine within a bi-objective evolutionary algori"},"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":"1802.02434","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-02-07T14:34:53Z","cross_cats_sorted":[],"title_canon_sha256":"651e3293dcdfe333cc26f54d09c06903335daee36638f7e5c139ee4bb119455a","abstract_canon_sha256":"f906367350df79a01f2a335acd1f2b243ea154d588e46c9c972c0c577833ca8a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:08.301667Z","signature_b64":"Uxg8YWCL2K2sbj3v/9BKlbLaxxE7CIbgQI5Ou37eK5N8FjsvEWkeKm6jM16+oO2rXnUyffhLZMZL1YR/R4xOAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d95481dc547609461d9d5857c53946dfee28c5eb15c2b589dfc701b89464eabe","last_reissued_at":"2026-05-18T00:24:08.301086Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:08.301086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Evolutionary Computation plus Dynamic Programming for the Bi-Objective Travelling Thief Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Frank Neumann, Junhua Wu, Markus Wagner, Sergey Polyakovskiy","submitted_at":"2018-02-07T14:34:53Z","abstract_excerpt":"This research proposes a novel indicator-based hybrid evolutionary approach that combines approximate and exact algorithms. We apply it to a new bi-criteria formulation of the travelling thief problem, which is known to the Evolutionary Computation community as a benchmark multi-component optimisation problem that interconnects two classical NP-hard problems: the travelling salesman problem and the 0-1 knapsack problem. Our approach employs the exact dynamic programming algorithm for the underlying Packing-While-Travelling (PWT) problem as a subroutine within a bi-objective evolutionary algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02434","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":"1802.02434","created_at":"2026-05-18T00:24:08.301176+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.02434v1","created_at":"2026-05-18T00:24:08.301176+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02434","created_at":"2026-05-18T00:24:08.301176+00:00"},{"alias_kind":"pith_short_12","alias_value":"3FKIDXCUOYEU","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"3FKIDXCUOYEUMHM5","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"3FKIDXCU","created_at":"2026-05-18T12:32:02.567920+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/3FKIDXCUOYEUMHM5LBL4KOKG37","json":"https://pith.science/pith/3FKIDXCUOYEUMHM5LBL4KOKG37.json","graph_json":"https://pith.science/api/pith-number/3FKIDXCUOYEUMHM5LBL4KOKG37/graph.json","events_json":"https://pith.science/api/pith-number/3FKIDXCUOYEUMHM5LBL4KOKG37/events.json","paper":"https://pith.science/paper/3FKIDXCU"},"agent_actions":{"view_html":"https://pith.science/pith/3FKIDXCUOYEUMHM5LBL4KOKG37","download_json":"https://pith.science/pith/3FKIDXCUOYEUMHM5LBL4KOKG37.json","view_paper":"https://pith.science/paper/3FKIDXCU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.02434&json=true","fetch_graph":"https://pith.science/api/pith-number/3FKIDXCUOYEUMHM5LBL4KOKG37/graph.json","fetch_events":"https://pith.science/api/pith-number/3FKIDXCUOYEUMHM5LBL4KOKG37/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3FKIDXCUOYEUMHM5LBL4KOKG37/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3FKIDXCUOYEUMHM5LBL4KOKG37/action/storage_attestation","attest_author":"https://pith.science/pith/3FKIDXCUOYEUMHM5LBL4KOKG37/action/author_attestation","sign_citation":"https://pith.science/pith/3FKIDXCUOYEUMHM5LBL4KOKG37/action/citation_signature","submit_replication":"https://pith.science/pith/3FKIDXCUOYEUMHM5LBL4KOKG37/action/replication_record"}},"created_at":"2026-05-18T00:24:08.301176+00:00","updated_at":"2026-05-18T00:24:08.301176+00:00"}