{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Q7ADEHRFVSHVUADLAAMG3CX5WG","short_pith_number":"pith:Q7ADEHRF","canonical_record":{"source":{"id":"1807.09437","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-07-25T05:21:34Z","cross_cats_sorted":[],"title_canon_sha256":"2eb75888ad529b4094533f7e1b2fc63aba4a38ef9561b40230104d881cd2783f","abstract_canon_sha256":"299201c892832874a53c8a5a96e928cd87160105bd23325187c0cf5444d2384e"},"schema_version":"1.0"},"canonical_sha256":"87c0321e25ac8f5a006b00186d8afdb1bbf842a5c40405881f81abd54a81c900","source":{"kind":"arxiv","id":"1807.09437","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.09437","created_at":"2026-05-17T23:52:52Z"},{"alias_kind":"arxiv_version","alias_value":"1807.09437v2","created_at":"2026-05-17T23:52:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09437","created_at":"2026-05-17T23:52:52Z"},{"alias_kind":"pith_short_12","alias_value":"Q7ADEHRFVSHV","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"Q7ADEHRFVSHVUADL","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"Q7ADEHRF","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Q7ADEHRFVSHVUADLAAMG3CX5WG","target":"record","payload":{"canonical_record":{"source":{"id":"1807.09437","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-07-25T05:21:34Z","cross_cats_sorted":[],"title_canon_sha256":"2eb75888ad529b4094533f7e1b2fc63aba4a38ef9561b40230104d881cd2783f","abstract_canon_sha256":"299201c892832874a53c8a5a96e928cd87160105bd23325187c0cf5444d2384e"},"schema_version":"1.0"},"canonical_sha256":"87c0321e25ac8f5a006b00186d8afdb1bbf842a5c40405881f81abd54a81c900","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:52.610227Z","signature_b64":"XYMHiwsBBmXKYuYn+pzwv2KAKE5Yr0lmSOl7U5bbWcIgdt603xcwHKM50BUxyvqx79LiaTlrJmUR9ohOVSoqBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87c0321e25ac8f5a006b00186d8afdb1bbf842a5c40405881f81abd54a81c900","last_reissued_at":"2026-05-17T23:52:52.609419Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:52.609419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.09437","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-17T23:52:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R2gsQ+4qvV/me483VemlG30sJhNJE8wMDygL+vtRUz//w7GPCFe6fNAVR/kg/9x2kAh51b31CUbtFwIgZZgJAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:06:08.698898Z"},"content_sha256":"d5946f3154d279be6aa66123700c7675daa38bf8712f633c969b9e3197b3eb9d","schema_version":"1.0","event_id":"sha256:d5946f3154d279be6aa66123700c7675daa38bf8712f633c969b9e3197b3eb9d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Q7ADEHRFVSHVUADLAAMG3CX5WG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tree Search Techniques for Minimizing Detectability and Maximizing Visibility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Jonathon M. Smereka, Joseph Lee, Lifeng Zhou, Pratap Tokekar, Yoonchang Sung, Zhongshun Zhang","submitted_at":"2018-07-25T05:21:34Z","abstract_excerpt":"We introduce and study the problem of planning a trajectory for an agent to carry out a scouting mission while avoiding being detected by an adversarial guard. This introduces an adversarial version of classical visibility-based planning problems such as the Watchman Route Problem. The agent receives a positive reward for increasing its visibility and a negative penalty when it is detected by the guard. The objective is to find a finite-horizon path for the agent that balances the trade-off maximizing visibility and minimizing detectability. We model this problem as a sequential two-player zer"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09437","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-17T23:52:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jsfEWQyVZmHvuBpUpix/M9OO+qF7EawPuZVeoq3yeEJ3SiHeSqrSwPKBqU1jG03ly7ww63AZZTsNKokrmTYgCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:06:08.699234Z"},"content_sha256":"ae44aedd9f6b43f5fed85f86190ee65b5c5c174517efd5f08a9a25a007c461e5","schema_version":"1.0","event_id":"sha256:ae44aedd9f6b43f5fed85f86190ee65b5c5c174517efd5f08a9a25a007c461e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q7ADEHRFVSHVUADLAAMG3CX5WG/bundle.json","state_url":"https://pith.science/pith/Q7ADEHRFVSHVUADLAAMG3CX5WG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q7ADEHRFVSHVUADLAAMG3CX5WG/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-01T21:06:08Z","links":{"resolver":"https://pith.science/pith/Q7ADEHRFVSHVUADLAAMG3CX5WG","bundle":"https://pith.science/pith/Q7ADEHRFVSHVUADLAAMG3CX5WG/bundle.json","state":"https://pith.science/pith/Q7ADEHRFVSHVUADLAAMG3CX5WG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q7ADEHRFVSHVUADLAAMG3CX5WG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Q7ADEHRFVSHVUADLAAMG3CX5WG","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":"299201c892832874a53c8a5a96e928cd87160105bd23325187c0cf5444d2384e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-07-25T05:21:34Z","title_canon_sha256":"2eb75888ad529b4094533f7e1b2fc63aba4a38ef9561b40230104d881cd2783f"},"schema_version":"1.0","source":{"id":"1807.09437","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.09437","created_at":"2026-05-17T23:52:52Z"},{"alias_kind":"arxiv_version","alias_value":"1807.09437v2","created_at":"2026-05-17T23:52:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09437","created_at":"2026-05-17T23:52:52Z"},{"alias_kind":"pith_short_12","alias_value":"Q7ADEHRFVSHV","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"Q7ADEHRFVSHVUADL","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"Q7ADEHRF","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:ae44aedd9f6b43f5fed85f86190ee65b5c5c174517efd5f08a9a25a007c461e5","target":"graph","created_at":"2026-05-17T23:52:52Z","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 of planning a trajectory for an agent to carry out a scouting mission while avoiding being detected by an adversarial guard. This introduces an adversarial version of classical visibility-based planning problems such as the Watchman Route Problem. The agent receives a positive reward for increasing its visibility and a negative penalty when it is detected by the guard. The objective is to find a finite-horizon path for the agent that balances the trade-off maximizing visibility and minimizing detectability. We model this problem as a sequential two-player zer","authors_text":"Jonathon M. Smereka, Joseph Lee, Lifeng Zhou, Pratap Tokekar, Yoonchang Sung, Zhongshun Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-07-25T05:21:34Z","title":"Tree Search Techniques for Minimizing Detectability and Maximizing Visibility"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09437","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:d5946f3154d279be6aa66123700c7675daa38bf8712f633c969b9e3197b3eb9d","target":"record","created_at":"2026-05-17T23:52:52Z","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":"299201c892832874a53c8a5a96e928cd87160105bd23325187c0cf5444d2384e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-07-25T05:21:34Z","title_canon_sha256":"2eb75888ad529b4094533f7e1b2fc63aba4a38ef9561b40230104d881cd2783f"},"schema_version":"1.0","source":{"id":"1807.09437","kind":"arxiv","version":2}},"canonical_sha256":"87c0321e25ac8f5a006b00186d8afdb1bbf842a5c40405881f81abd54a81c900","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"87c0321e25ac8f5a006b00186d8afdb1bbf842a5c40405881f81abd54a81c900","first_computed_at":"2026-05-17T23:52:52.609419Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:52.609419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XYMHiwsBBmXKYuYn+pzwv2KAKE5Yr0lmSOl7U5bbWcIgdt603xcwHKM50BUxyvqx79LiaTlrJmUR9ohOVSoqBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:52.610227Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.09437","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5946f3154d279be6aa66123700c7675daa38bf8712f633c969b9e3197b3eb9d","sha256:ae44aedd9f6b43f5fed85f86190ee65b5c5c174517efd5f08a9a25a007c461e5"],"state_sha256":"363e5f5919399d8d1be3dd320cade5514eff4717b4c401c503d8ace273d6c548"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G8Fs5ux1dvR6jCYTjmRuLoxoiamuC+YiL++EA1wnZJNU6jeKAi+VbXmpR/G4IlOHxtRpYkbSaal1sgcki2yTDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:06:08.701046Z","bundle_sha256":"bf9ecbaeefa2fc4ad56ab4d402d7efccab6da5106d2630c08f3eb62421b85aff"}}