{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WAXTLSXUKRIJTLBRVGJPLX3335","short_pith_number":"pith:WAXTLSXU","canonical_record":{"source":{"id":"1409.8536","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2014-09-30T13:25:49Z","cross_cats_sorted":[],"title_canon_sha256":"4ee897dab5d74f96e638efa1f704acaabe73842b6701db81d0fdd5fe541369b3","abstract_canon_sha256":"50d91193367f5aa9536e7325f60c6fd609c038bccebce5b43d5ba4544ad52cfa"},"schema_version":"1.0"},"canonical_sha256":"b02f35caf4545099ac31a992f5df7bdf5cb1aed7e1145f09e6f3d9771055602f","source":{"kind":"arxiv","id":"1409.8536","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.8536","created_at":"2026-05-18T02:40:46Z"},{"alias_kind":"arxiv_version","alias_value":"1409.8536v3","created_at":"2026-05-18T02:40:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.8536","created_at":"2026-05-18T02:40:46Z"},{"alias_kind":"pith_short_12","alias_value":"WAXTLSXUKRIJ","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WAXTLSXUKRIJTLBR","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WAXTLSXU","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WAXTLSXUKRIJTLBRVGJPLX3335","target":"record","payload":{"canonical_record":{"source":{"id":"1409.8536","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2014-09-30T13:25:49Z","cross_cats_sorted":[],"title_canon_sha256":"4ee897dab5d74f96e638efa1f704acaabe73842b6701db81d0fdd5fe541369b3","abstract_canon_sha256":"50d91193367f5aa9536e7325f60c6fd609c038bccebce5b43d5ba4544ad52cfa"},"schema_version":"1.0"},"canonical_sha256":"b02f35caf4545099ac31a992f5df7bdf5cb1aed7e1145f09e6f3d9771055602f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:46.917963Z","signature_b64":"U218KczG0sXikYpOEdIXm+PogRz8zvMPN6sUvCHBsWvXwG8H9GhQzErY9aPoO1PK6w6sppGkswv9rNK2Y7n+DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b02f35caf4545099ac31a992f5df7bdf5cb1aed7e1145f09e6f3d9771055602f","last_reissued_at":"2026-05-18T02:40:46.917483Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:46.917483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.8536","source_version":3,"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-18T02:40:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"04g/5cPI5pFzjsgeyFgC3HKGTtjUhfUrRD/3ZmIOQdJaW4Kv3to7Ajo+k58z2a3mnd/vwgrV1pq+eRNdrOQKBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:01:15.670023Z"},"content_sha256":"cb22f84356931785457115fce53ba9b1351419a131ad02721203b50bb3c5c0d7","schema_version":"1.0","event_id":"sha256:cb22f84356931785457115fce53ba9b1351419a131ad02721203b50bb3c5c0d7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WAXTLSXUKRIJTLBRVGJPLX3335","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Tourist Problem and Anytime Planning of Trip Itineraries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Daniela Rus, Javed Aslam, Jingjin Yu, Sertac Karaman","submitted_at":"2014-09-30T13:25:49Z","abstract_excerpt":"We introduce and study the problem in which a mobile sensing robot (our tourist) is tasked to travel among and gather intelligence at a set of spatially distributed point-of-interests (POIs). The quality of the information collected at each POI is characterized by some non-decreasing reward function over the time spent at the POI. With limited time budget, the robot must balance between spending time traveling to POIs and spending time at POIs for information collection (sensing) so as to maximize the total reward. Alternatively, the robot may be required to acquire a minimum mount of reward a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.8536","kind":"arxiv","version":3},"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-18T02:40:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W+V3BUZsvBX4l41ecDIovnqayeP9AwbPBDRCGoSVe8RfIOATmCyUSw2+ZCtpbcDLYdVZ9RlzYiYfOe3k16pKAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:01:15.670737Z"},"content_sha256":"e91311b63596527015dd222c75b34b6f8d078a3bb89926fd91d768c6b48842ea","schema_version":"1.0","event_id":"sha256:e91311b63596527015dd222c75b34b6f8d078a3bb89926fd91d768c6b48842ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WAXTLSXUKRIJTLBRVGJPLX3335/bundle.json","state_url":"https://pith.science/pith/WAXTLSXUKRIJTLBRVGJPLX3335/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WAXTLSXUKRIJTLBRVGJPLX3335/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-05-31T21:01:15Z","links":{"resolver":"https://pith.science/pith/WAXTLSXUKRIJTLBRVGJPLX3335","bundle":"https://pith.science/pith/WAXTLSXUKRIJTLBRVGJPLX3335/bundle.json","state":"https://pith.science/pith/WAXTLSXUKRIJTLBRVGJPLX3335/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WAXTLSXUKRIJTLBRVGJPLX3335/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WAXTLSXUKRIJTLBRVGJPLX3335","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":"50d91193367f5aa9536e7325f60c6fd609c038bccebce5b43d5ba4544ad52cfa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2014-09-30T13:25:49Z","title_canon_sha256":"4ee897dab5d74f96e638efa1f704acaabe73842b6701db81d0fdd5fe541369b3"},"schema_version":"1.0","source":{"id":"1409.8536","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.8536","created_at":"2026-05-18T02:40:46Z"},{"alias_kind":"arxiv_version","alias_value":"1409.8536v3","created_at":"2026-05-18T02:40:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.8536","created_at":"2026-05-18T02:40:46Z"},{"alias_kind":"pith_short_12","alias_value":"WAXTLSXUKRIJ","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WAXTLSXUKRIJTLBR","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WAXTLSXU","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:e91311b63596527015dd222c75b34b6f8d078a3bb89926fd91d768c6b48842ea","target":"graph","created_at":"2026-05-18T02:40:46Z","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 introduce and study the problem in which a mobile sensing robot (our tourist) is tasked to travel among and gather intelligence at a set of spatially distributed point-of-interests (POIs). The quality of the information collected at each POI is characterized by some non-decreasing reward function over the time spent at the POI. With limited time budget, the robot must balance between spending time traveling to POIs and spending time at POIs for information collection (sensing) so as to maximize the total reward. Alternatively, the robot may be required to acquire a minimum mount of reward a","authors_text":"Daniela Rus, Javed Aslam, Jingjin Yu, Sertac Karaman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2014-09-30T13:25:49Z","title":"Optimal Tourist Problem and Anytime Planning of Trip Itineraries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.8536","kind":"arxiv","version":3},"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:cb22f84356931785457115fce53ba9b1351419a131ad02721203b50bb3c5c0d7","target":"record","created_at":"2026-05-18T02:40:46Z","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":"50d91193367f5aa9536e7325f60c6fd609c038bccebce5b43d5ba4544ad52cfa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2014-09-30T13:25:49Z","title_canon_sha256":"4ee897dab5d74f96e638efa1f704acaabe73842b6701db81d0fdd5fe541369b3"},"schema_version":"1.0","source":{"id":"1409.8536","kind":"arxiv","version":3}},"canonical_sha256":"b02f35caf4545099ac31a992f5df7bdf5cb1aed7e1145f09e6f3d9771055602f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b02f35caf4545099ac31a992f5df7bdf5cb1aed7e1145f09e6f3d9771055602f","first_computed_at":"2026-05-18T02:40:46.917483Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:40:46.917483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U218KczG0sXikYpOEdIXm+PogRz8zvMPN6sUvCHBsWvXwG8H9GhQzErY9aPoO1PK6w6sppGkswv9rNK2Y7n+DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:40:46.917963Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.8536","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb22f84356931785457115fce53ba9b1351419a131ad02721203b50bb3c5c0d7","sha256:e91311b63596527015dd222c75b34b6f8d078a3bb89926fd91d768c6b48842ea"],"state_sha256":"6ee9f7818454d4955fcc25c05daf1071462e2ed3e17838ca633f86b6343dde02"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LnMbZjSOUaof5dVe37KUQO8WUnF6eE7KAr88lP2yOdWStVvb7tCTekaYiD7J9N+xrGuV2fdiTpUyAX9G6D+mCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T21:01:15.674602Z","bundle_sha256":"e8259af6453a61d66691278c407fa84aad263174d0e5b2c4992a81283fa6bf1f"}}