{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PH5J6RDWM632N3ZN3BHRNJ6IYS","short_pith_number":"pith:PH5J6RDW","canonical_record":{"source":{"id":"1702.04304","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-14T17:29:03Z","cross_cats_sorted":[],"title_canon_sha256":"9960d29cf9592cf1ddd4bf22fd26ff847648b47cfd81193cd5e5588382c3a986","abstract_canon_sha256":"2fc1f729f440bd5a8c68565cc7f31c8f8974e75cc6aac74bc7a76453931c6adb"},"schema_version":"1.0"},"canonical_sha256":"79fa9f447667b7a6ef2dd84f16a7c8c4ba530411fa8f66387d0b96f3512c0448","source":{"kind":"arxiv","id":"1702.04304","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.04304","created_at":"2026-05-18T00:50:43Z"},{"alias_kind":"arxiv_version","alias_value":"1702.04304v1","created_at":"2026-05-18T00:50:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04304","created_at":"2026-05-18T00:50:43Z"},{"alias_kind":"pith_short_12","alias_value":"PH5J6RDWM632","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PH5J6RDWM632N3ZN","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PH5J6RDW","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PH5J6RDWM632N3ZN3BHRNJ6IYS","target":"record","payload":{"canonical_record":{"source":{"id":"1702.04304","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-14T17:29:03Z","cross_cats_sorted":[],"title_canon_sha256":"9960d29cf9592cf1ddd4bf22fd26ff847648b47cfd81193cd5e5588382c3a986","abstract_canon_sha256":"2fc1f729f440bd5a8c68565cc7f31c8f8974e75cc6aac74bc7a76453931c6adb"},"schema_version":"1.0"},"canonical_sha256":"79fa9f447667b7a6ef2dd84f16a7c8c4ba530411fa8f66387d0b96f3512c0448","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:43.542065Z","signature_b64":"5cqchwdWbUn1LfgcrLH02zJJWfehmUfcxGoIxeegBGoYclVaXQ19if7iw5Vp7Cqg+dCE3VKdykqTafBTGNmhDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79fa9f447667b7a6ef2dd84f16a7c8c4ba530411fa8f66387d0b96f3512c0448","last_reissued_at":"2026-05-18T00:50:43.541440Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:43.541440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.04304","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-18T00:50:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZBbFfIkEsw2F2Y1K9JkGsaMhRLJbn6o8fKUCdTIUghbAwMTs3GMrO6smBey1xrg58Nx9cTDMSxg1IEDuxjSeDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:00:08.331018Z"},"content_sha256":"b2977df29c022de04a14daea27fa204277897f1fc7f37bb829f7e22fa6492c3c","schema_version":"1.0","event_id":"sha256:b2977df29c022de04a14daea27fa204277897f1fc7f37bb829f7e22fa6492c3c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PH5J6RDWM632N3ZN3BHRNJ6IYS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving Orienteering with Category Constraints Using Prioritized Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Paolo Bolzoni, Sven Helmer","submitted_at":"2017-02-14T17:29:03Z","abstract_excerpt":"We develop an approach for solving rooted orienteering problems with category constraints as found in tourist trip planning and logistics. It is based on expanding partial solutions in a systematic way, prioritizing promising ones, which reduces the search space we have to traverse during the search. The category constraints help in reducing the space we have to explore even further. We implement an algorithm that computes the optimal solution and also illustrate how our approach can be turned into an approximation algorithm, yielding much faster run times and guaranteeing lower bounds on the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04304","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-18T00:50:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n97hAuA0kS2iy9SLw/pcsEIIPJD9mA/OlxWppPblaCKBCWr707wLXQJ/H8cQWGRFWGvIZRHH+otTEWRahPYWDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:00:08.331367Z"},"content_sha256":"d18c108e603882bbf0cceaffa891e6e01148703ef02a02ef5e352fd46995554e","schema_version":"1.0","event_id":"sha256:d18c108e603882bbf0cceaffa891e6e01148703ef02a02ef5e352fd46995554e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PH5J6RDWM632N3ZN3BHRNJ6IYS/bundle.json","state_url":"https://pith.science/pith/PH5J6RDWM632N3ZN3BHRNJ6IYS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PH5J6RDWM632N3ZN3BHRNJ6IYS/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-03T20:00:08Z","links":{"resolver":"https://pith.science/pith/PH5J6RDWM632N3ZN3BHRNJ6IYS","bundle":"https://pith.science/pith/PH5J6RDWM632N3ZN3BHRNJ6IYS/bundle.json","state":"https://pith.science/pith/PH5J6RDWM632N3ZN3BHRNJ6IYS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PH5J6RDWM632N3ZN3BHRNJ6IYS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PH5J6RDWM632N3ZN3BHRNJ6IYS","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":"2fc1f729f440bd5a8c68565cc7f31c8f8974e75cc6aac74bc7a76453931c6adb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-14T17:29:03Z","title_canon_sha256":"9960d29cf9592cf1ddd4bf22fd26ff847648b47cfd81193cd5e5588382c3a986"},"schema_version":"1.0","source":{"id":"1702.04304","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.04304","created_at":"2026-05-18T00:50:43Z"},{"alias_kind":"arxiv_version","alias_value":"1702.04304v1","created_at":"2026-05-18T00:50:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04304","created_at":"2026-05-18T00:50:43Z"},{"alias_kind":"pith_short_12","alias_value":"PH5J6RDWM632","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PH5J6RDWM632N3ZN","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PH5J6RDW","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:d18c108e603882bbf0cceaffa891e6e01148703ef02a02ef5e352fd46995554e","target":"graph","created_at":"2026-05-18T00:50:43Z","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":"We develop an approach for solving rooted orienteering problems with category constraints as found in tourist trip planning and logistics. It is based on expanding partial solutions in a systematic way, prioritizing promising ones, which reduces the search space we have to traverse during the search. The category constraints help in reducing the space we have to explore even further. We implement an algorithm that computes the optimal solution and also illustrate how our approach can be turned into an approximation algorithm, yielding much faster run times and guaranteeing lower bounds on the ","authors_text":"Paolo Bolzoni, Sven Helmer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-14T17:29:03Z","title":"Solving Orienteering with Category Constraints Using Prioritized Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04304","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:b2977df29c022de04a14daea27fa204277897f1fc7f37bb829f7e22fa6492c3c","target":"record","created_at":"2026-05-18T00:50:43Z","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":"2fc1f729f440bd5a8c68565cc7f31c8f8974e75cc6aac74bc7a76453931c6adb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-14T17:29:03Z","title_canon_sha256":"9960d29cf9592cf1ddd4bf22fd26ff847648b47cfd81193cd5e5588382c3a986"},"schema_version":"1.0","source":{"id":"1702.04304","kind":"arxiv","version":1}},"canonical_sha256":"79fa9f447667b7a6ef2dd84f16a7c8c4ba530411fa8f66387d0b96f3512c0448","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79fa9f447667b7a6ef2dd84f16a7c8c4ba530411fa8f66387d0b96f3512c0448","first_computed_at":"2026-05-18T00:50:43.541440Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:43.541440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5cqchwdWbUn1LfgcrLH02zJJWfehmUfcxGoIxeegBGoYclVaXQ19if7iw5Vp7Cqg+dCE3VKdykqTafBTGNmhDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:43.542065Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.04304","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2977df29c022de04a14daea27fa204277897f1fc7f37bb829f7e22fa6492c3c","sha256:d18c108e603882bbf0cceaffa891e6e01148703ef02a02ef5e352fd46995554e"],"state_sha256":"0b04160056d56a646bb9c9f33d260993a9cfa28cfcb687814270259d4e6a2ec4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zmmk5lqosJaVk4DzRnBhOP2cUGA317OyuvxLfjeZqMNu0KERE8ffUkfKOncHe6XJO9BBlc5JY+BjqgJ0Lcx4Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T20:00:08.333222Z","bundle_sha256":"e1c972d32ee935b11678bc83bf91ff05cd43f7cbd32517d0e902f8d21d28faa1"}}