{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:V2QBO7SSZ5K2YA5KBRZBGZZ2B6","short_pith_number":"pith:V2QBO7SS","schema_version":"1.0","canonical_sha256":"aea0177e52cf55ac03aa0c7213673a0fac7586ce5cce43f95d89dbc93fb078eb","source":{"kind":"arxiv","id":"1512.08831","version":2},"attestation_state":"computed","paper":{"title":"The Packing While Traveling Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Frank Neumann, Sergey Polyakovskiy","submitted_at":"2015-12-30T02:40:39Z","abstract_excerpt":"This paper introduces the Packing While Traveling problem as a new non-linear knapsack problem. Given are a set of cities that have a set of items of distinct profits and weights and a vehicle that may collect the items when visiting all the cities in a fixed order. Each selected item contributes its profit, but produces a transportation cost relative to its weight. The problem asks to find a subset of the items such that the total gain is maximized. We investigate constrained and unconstrained versions of the problem and show that both are NP-hard. We propose a pre-processing scheme that decr"},"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":"1512.08831","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-30T02:40:39Z","cross_cats_sorted":[],"title_canon_sha256":"3e6b0a3b2fbb7491c21801ebda562a61d20b7372a245b9c6716737b6339e07e0","abstract_canon_sha256":"47c424f4ff77bcad2b82bb20e4c9eec7373bb59d28d3e3cd50ddb6c7e14b31df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:20.335679Z","signature_b64":"BquD0Pax2BMfNde6ktXvC4zWMj26JoO9bvLjcJKAPYotCPHTVu09JUXqQ7HFZJWohc80MbBPKhrgWz869gACBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aea0177e52cf55ac03aa0c7213673a0fac7586ce5cce43f95d89dbc93fb078eb","last_reissued_at":"2026-05-18T00:48:20.334927Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:20.334927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Packing While Traveling Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Frank Neumann, Sergey Polyakovskiy","submitted_at":"2015-12-30T02:40:39Z","abstract_excerpt":"This paper introduces the Packing While Traveling problem as a new non-linear knapsack problem. Given are a set of cities that have a set of items of distinct profits and weights and a vehicle that may collect the items when visiting all the cities in a fixed order. Each selected item contributes its profit, but produces a transportation cost relative to its weight. The problem asks to find a subset of the items such that the total gain is maximized. We investigate constrained and unconstrained versions of the problem and show that both are NP-hard. We propose a pre-processing scheme that decr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.08831","kind":"arxiv","version":2},"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":"1512.08831","created_at":"2026-05-18T00:48:20.335046+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.08831v2","created_at":"2026-05-18T00:48:20.335046+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.08831","created_at":"2026-05-18T00:48:20.335046+00:00"},{"alias_kind":"pith_short_12","alias_value":"V2QBO7SSZ5K2","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"V2QBO7SSZ5K2YA5K","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"V2QBO7SS","created_at":"2026-05-18T12:29:44.643036+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/V2QBO7SSZ5K2YA5KBRZBGZZ2B6","json":"https://pith.science/pith/V2QBO7SSZ5K2YA5KBRZBGZZ2B6.json","graph_json":"https://pith.science/api/pith-number/V2QBO7SSZ5K2YA5KBRZBGZZ2B6/graph.json","events_json":"https://pith.science/api/pith-number/V2QBO7SSZ5K2YA5KBRZBGZZ2B6/events.json","paper":"https://pith.science/paper/V2QBO7SS"},"agent_actions":{"view_html":"https://pith.science/pith/V2QBO7SSZ5K2YA5KBRZBGZZ2B6","download_json":"https://pith.science/pith/V2QBO7SSZ5K2YA5KBRZBGZZ2B6.json","view_paper":"https://pith.science/paper/V2QBO7SS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.08831&json=true","fetch_graph":"https://pith.science/api/pith-number/V2QBO7SSZ5K2YA5KBRZBGZZ2B6/graph.json","fetch_events":"https://pith.science/api/pith-number/V2QBO7SSZ5K2YA5KBRZBGZZ2B6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V2QBO7SSZ5K2YA5KBRZBGZZ2B6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V2QBO7SSZ5K2YA5KBRZBGZZ2B6/action/storage_attestation","attest_author":"https://pith.science/pith/V2QBO7SSZ5K2YA5KBRZBGZZ2B6/action/author_attestation","sign_citation":"https://pith.science/pith/V2QBO7SSZ5K2YA5KBRZBGZZ2B6/action/citation_signature","submit_replication":"https://pith.science/pith/V2QBO7SSZ5K2YA5KBRZBGZZ2B6/action/replication_record"}},"created_at":"2026-05-18T00:48:20.335046+00:00","updated_at":"2026-05-18T00:48:20.335046+00:00"}