{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:V2QBO7SSZ5K2YA5KBRZBGZZ2B6","short_pith_number":"pith:V2QBO7SS","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"},"canonical_sha256":"aea0177e52cf55ac03aa0c7213673a0fac7586ce5cce43f95d89dbc93fb078eb","source":{"kind":"arxiv","id":"1512.08831","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.08831","created_at":"2026-05-18T00:48:20Z"},{"alias_kind":"arxiv_version","alias_value":"1512.08831v2","created_at":"2026-05-18T00:48:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.08831","created_at":"2026-05-18T00:48:20Z"},{"alias_kind":"pith_short_12","alias_value":"V2QBO7SSZ5K2","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"V2QBO7SSZ5K2YA5K","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"V2QBO7SS","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:V2QBO7SSZ5K2YA5KBRZBGZZ2B6","target":"record","payload":{"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"},"canonical_sha256":"aea0177e52cf55ac03aa0c7213673a0fac7586ce5cce43f95d89dbc93fb078eb","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"},"source_kind":"arxiv","source_id":"1512.08831","source_version":2,"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-18T00:48:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rm3gqRXEuRRTOIHvdImAlXpX2t42ujV1S8anzw2WVGDgCePC+chztc14C3oxM4wr+xrG6eL4qNYSvrxfZhUiDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T16:02:47.141974Z"},"content_sha256":"04f846d68b9ad503e010d3a41f3493d7a72ab563e9dafa0396be389a20e29b97","schema_version":"1.0","event_id":"sha256:04f846d68b9ad503e010d3a41f3493d7a72ab563e9dafa0396be389a20e29b97"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:V2QBO7SSZ5K2YA5KBRZBGZZ2B6","target":"graph","payload":{"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"},"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-18T00:48:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ECI43H0hhFlzw0yKNc2gpS0G7JJjHXQzzA4of+JZUuJlChulASmtZhn5E8gyxCCnc4eTDbKlaUtGdbnulmKmCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T16:02:47.142482Z"},"content_sha256":"62d659af19c60d0663e3741021cff7159db2c156f35267f4e94a9d552d8e3e56","schema_version":"1.0","event_id":"sha256:62d659af19c60d0663e3741021cff7159db2c156f35267f4e94a9d552d8e3e56"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V2QBO7SSZ5K2YA5KBRZBGZZ2B6/bundle.json","state_url":"https://pith.science/pith/V2QBO7SSZ5K2YA5KBRZBGZZ2B6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V2QBO7SSZ5K2YA5KBRZBGZZ2B6/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-23T16:02:47Z","links":{"resolver":"https://pith.science/pith/V2QBO7SSZ5K2YA5KBRZBGZZ2B6","bundle":"https://pith.science/pith/V2QBO7SSZ5K2YA5KBRZBGZZ2B6/bundle.json","state":"https://pith.science/pith/V2QBO7SSZ5K2YA5KBRZBGZZ2B6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V2QBO7SSZ5K2YA5KBRZBGZZ2B6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:V2QBO7SSZ5K2YA5KBRZBGZZ2B6","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":"47c424f4ff77bcad2b82bb20e4c9eec7373bb59d28d3e3cd50ddb6c7e14b31df","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-30T02:40:39Z","title_canon_sha256":"3e6b0a3b2fbb7491c21801ebda562a61d20b7372a245b9c6716737b6339e07e0"},"schema_version":"1.0","source":{"id":"1512.08831","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.08831","created_at":"2026-05-18T00:48:20Z"},{"alias_kind":"arxiv_version","alias_value":"1512.08831v2","created_at":"2026-05-18T00:48:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.08831","created_at":"2026-05-18T00:48:20Z"},{"alias_kind":"pith_short_12","alias_value":"V2QBO7SSZ5K2","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"V2QBO7SSZ5K2YA5K","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"V2QBO7SS","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:62d659af19c60d0663e3741021cff7159db2c156f35267f4e94a9d552d8e3e56","target":"graph","created_at":"2026-05-18T00:48:20Z","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":"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","authors_text":"Frank Neumann, Sergey Polyakovskiy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-30T02:40:39Z","title":"The Packing While Traveling Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.08831","kind":"arxiv","version":2},"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:04f846d68b9ad503e010d3a41f3493d7a72ab563e9dafa0396be389a20e29b97","target":"record","created_at":"2026-05-18T00:48:20Z","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":"47c424f4ff77bcad2b82bb20e4c9eec7373bb59d28d3e3cd50ddb6c7e14b31df","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-30T02:40:39Z","title_canon_sha256":"3e6b0a3b2fbb7491c21801ebda562a61d20b7372a245b9c6716737b6339e07e0"},"schema_version":"1.0","source":{"id":"1512.08831","kind":"arxiv","version":2}},"canonical_sha256":"aea0177e52cf55ac03aa0c7213673a0fac7586ce5cce43f95d89dbc93fb078eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aea0177e52cf55ac03aa0c7213673a0fac7586ce5cce43f95d89dbc93fb078eb","first_computed_at":"2026-05-18T00:48:20.334927Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:20.334927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BquD0Pax2BMfNde6ktXvC4zWMj26JoO9bvLjcJKAPYotCPHTVu09JUXqQ7HFZJWohc80MbBPKhrgWz869gACBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:20.335679Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.08831","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04f846d68b9ad503e010d3a41f3493d7a72ab563e9dafa0396be389a20e29b97","sha256:62d659af19c60d0663e3741021cff7159db2c156f35267f4e94a9d552d8e3e56"],"state_sha256":"f5eebbe6bb2c3171b171bcfd1c2104ffa880c4e92812d6efd621c6308a7e6220"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L0rEVT2NJ/5bqlndxrahYRH+PL9Ry0DElo2MLsOzwLxPtqDGA9Foi9dPGsqijMl76u447uNjP+OEwkIlxDHbBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T16:02:47.144827Z","bundle_sha256":"6ee0267f9dd86946833121900bfa013e1de1b030ed2fe071b4e3a2daf1a5ddad"}}