{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NUZ6YXNM4UOE5DHN63ZUPR7ZGU","short_pith_number":"pith:NUZ6YXNM","schema_version":"1.0","canonical_sha256":"6d33ec5dace51c4e8cedf6f347c7f9351c3e11d6f6423e6563025225cf4e8404","source":{"kind":"arxiv","id":"1702.05217","version":1},"attestation_state":"computed","paper":{"title":"A Fully Polynomial Time Approximation Scheme for Packing While Traveling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Frank Neumann, Junhua Wu, Leen Stougie, Martin Skutella, Sergey Polyakovskiy","submitted_at":"2017-02-17T04:06:45Z","abstract_excerpt":"Understanding the interactions between different combinatorial optimisation problems in real-world applications is a challenging task. Recently, the traveling thief problem (TTP), as a combination of the classical traveling salesperson problem and the knapsack problem, has been introduced to study these interactions in a systematic way. We investigate the underlying non-linear packing while traveling (PWT) problem of the TTP where items have to be selected along a fixed route. We give an exact dynamic programming approach for this problem and a fully polynomial time approximation scheme (FPTAS"},"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":"1702.05217","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-17T04:06:45Z","cross_cats_sorted":[],"title_canon_sha256":"67c6d759483671480e3864e75d4a9fda29046b2dc4c4278751fc2a2f4d13b8cf","abstract_canon_sha256":"1c31ed87b6a9215b93175c995ab46b8c0d5e847d163f9b967bc5736e9b5343ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:34.442367Z","signature_b64":"iNiYo2gDjQuv1Eb33I9HZS/JEhVJIIIaS5f5nQoPoEOet2dpaiJ0rE3Xow+rxNWg+ZQ/vNvv0q0y6OkQ88e5Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d33ec5dace51c4e8cedf6f347c7f9351c3e11d6f6423e6563025225cf4e8404","last_reissued_at":"2026-05-18T00:50:34.441711Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:34.441711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fully Polynomial Time Approximation Scheme for Packing While Traveling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Frank Neumann, Junhua Wu, Leen Stougie, Martin Skutella, Sergey Polyakovskiy","submitted_at":"2017-02-17T04:06:45Z","abstract_excerpt":"Understanding the interactions between different combinatorial optimisation problems in real-world applications is a challenging task. Recently, the traveling thief problem (TTP), as a combination of the classical traveling salesperson problem and the knapsack problem, has been introduced to study these interactions in a systematic way. We investigate the underlying non-linear packing while traveling (PWT) problem of the TTP where items have to be selected along a fixed route. We give an exact dynamic programming approach for this problem and a fully polynomial time approximation scheme (FPTAS"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05217","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":"1702.05217","created_at":"2026-05-18T00:50:34.441813+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.05217v1","created_at":"2026-05-18T00:50:34.441813+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05217","created_at":"2026-05-18T00:50:34.441813+00:00"},{"alias_kind":"pith_short_12","alias_value":"NUZ6YXNM4UOE","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"NUZ6YXNM4UOE5DHN","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"NUZ6YXNM","created_at":"2026-05-18T12:31:34.259226+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/NUZ6YXNM4UOE5DHN63ZUPR7ZGU","json":"https://pith.science/pith/NUZ6YXNM4UOE5DHN63ZUPR7ZGU.json","graph_json":"https://pith.science/api/pith-number/NUZ6YXNM4UOE5DHN63ZUPR7ZGU/graph.json","events_json":"https://pith.science/api/pith-number/NUZ6YXNM4UOE5DHN63ZUPR7ZGU/events.json","paper":"https://pith.science/paper/NUZ6YXNM"},"agent_actions":{"view_html":"https://pith.science/pith/NUZ6YXNM4UOE5DHN63ZUPR7ZGU","download_json":"https://pith.science/pith/NUZ6YXNM4UOE5DHN63ZUPR7ZGU.json","view_paper":"https://pith.science/paper/NUZ6YXNM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.05217&json=true","fetch_graph":"https://pith.science/api/pith-number/NUZ6YXNM4UOE5DHN63ZUPR7ZGU/graph.json","fetch_events":"https://pith.science/api/pith-number/NUZ6YXNM4UOE5DHN63ZUPR7ZGU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NUZ6YXNM4UOE5DHN63ZUPR7ZGU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NUZ6YXNM4UOE5DHN63ZUPR7ZGU/action/storage_attestation","attest_author":"https://pith.science/pith/NUZ6YXNM4UOE5DHN63ZUPR7ZGU/action/author_attestation","sign_citation":"https://pith.science/pith/NUZ6YXNM4UOE5DHN63ZUPR7ZGU/action/citation_signature","submit_replication":"https://pith.science/pith/NUZ6YXNM4UOE5DHN63ZUPR7ZGU/action/replication_record"}},"created_at":"2026-05-18T00:50:34.441813+00:00","updated_at":"2026-05-18T00:50:34.441813+00:00"}