{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:Q7ADEHRFVSHVUADLAAMG3CX5WG","short_pith_number":"pith:Q7ADEHRF","schema_version":"1.0","canonical_sha256":"87c0321e25ac8f5a006b00186d8afdb1bbf842a5c40405881f81abd54a81c900","source":{"kind":"arxiv","id":"1807.09437","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.09437","created_at":"2026-05-17T23:52:52.609542+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.09437v2","created_at":"2026-05-17T23:52:52.609542+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09437","created_at":"2026-05-17T23:52:52.609542+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q7ADEHRFVSHV","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q7ADEHRFVSHVUADL","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q7ADEHRF","created_at":"2026-05-18T12:32:46.962924+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/Q7ADEHRFVSHVUADLAAMG3CX5WG","json":"https://pith.science/pith/Q7ADEHRFVSHVUADLAAMG3CX5WG.json","graph_json":"https://pith.science/api/pith-number/Q7ADEHRFVSHVUADLAAMG3CX5WG/graph.json","events_json":"https://pith.science/api/pith-number/Q7ADEHRFVSHVUADLAAMG3CX5WG/events.json","paper":"https://pith.science/paper/Q7ADEHRF"},"agent_actions":{"view_html":"https://pith.science/pith/Q7ADEHRFVSHVUADLAAMG3CX5WG","download_json":"https://pith.science/pith/Q7ADEHRFVSHVUADLAAMG3CX5WG.json","view_paper":"https://pith.science/paper/Q7ADEHRF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.09437&json=true","fetch_graph":"https://pith.science/api/pith-number/Q7ADEHRFVSHVUADLAAMG3CX5WG/graph.json","fetch_events":"https://pith.science/api/pith-number/Q7ADEHRFVSHVUADLAAMG3CX5WG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q7ADEHRFVSHVUADLAAMG3CX5WG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q7ADEHRFVSHVUADLAAMG3CX5WG/action/storage_attestation","attest_author":"https://pith.science/pith/Q7ADEHRFVSHVUADLAAMG3CX5WG/action/author_attestation","sign_citation":"https://pith.science/pith/Q7ADEHRFVSHVUADLAAMG3CX5WG/action/citation_signature","submit_replication":"https://pith.science/pith/Q7ADEHRFVSHVUADLAAMG3CX5WG/action/replication_record"}},"created_at":"2026-05-17T23:52:52.609542+00:00","updated_at":"2026-05-17T23:52:52.609542+00:00"}