{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NIDEDYGQBQTA62UUGFWH2GDHR6","short_pith_number":"pith:NIDEDYGQ","canonical_record":{"source":{"id":"1811.04471","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-11T20:17:01Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"0edc78cd9de6e1ac567ed1257058073f26b2c84cfd135d81d4192d2cf508e283","abstract_canon_sha256":"74a674fffa3817a1f0ebec740080d2cf1753c35d9569635871f65d426cf9c808"},"schema_version":"1.0"},"canonical_sha256":"6a0641e0d00c260f6a94316c7d18678f99799e601a79598e6da6aca0c5f57754","source":{"kind":"arxiv","id":"1811.04471","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.04471","created_at":"2026-05-18T00:01:05Z"},{"alias_kind":"arxiv_version","alias_value":"1811.04471v1","created_at":"2026-05-18T00:01:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.04471","created_at":"2026-05-18T00:01:05Z"},{"alias_kind":"pith_short_12","alias_value":"NIDEDYGQBQTA","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NIDEDYGQBQTA62UU","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NIDEDYGQ","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NIDEDYGQBQTA62UUGFWH2GDHR6","target":"record","payload":{"canonical_record":{"source":{"id":"1811.04471","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-11T20:17:01Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"0edc78cd9de6e1ac567ed1257058073f26b2c84cfd135d81d4192d2cf508e283","abstract_canon_sha256":"74a674fffa3817a1f0ebec740080d2cf1753c35d9569635871f65d426cf9c808"},"schema_version":"1.0"},"canonical_sha256":"6a0641e0d00c260f6a94316c7d18678f99799e601a79598e6da6aca0c5f57754","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:05.094505Z","signature_b64":"/FepMC5E2Dfa8gim3XjOv1amJ3YAlFwIKKTGP28UTEEgBfcitMeC0IDGFnMEEHdcJvwyqV7lQuEC3WhXGcQdCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a0641e0d00c260f6a94316c7d18678f99799e601a79598e6da6aca0c5f57754","last_reissued_at":"2026-05-18T00:01:05.093764Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:05.093764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.04471","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:01:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CeZeSt9rhzvyNlCzsBKVpFPqqQr1bfedOPsk9ocxJSBZ9zDPdCg1R0ORsuUl1cProg0qzNzJQWuZ1ffvXUldBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:10:19.717367Z"},"content_sha256":"9895f31434558737327c75fd200d4e999262cc7ff769ffb4987867de4fe5ad2f","schema_version":"1.0","event_id":"sha256:9895f31434558737327c75fd200d4e999262cc7ff769ffb4987867de4fe5ad2f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NIDEDYGQBQTA62UUGFWH2GDHR6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Thompson Sampling for Pursuit-Evasion Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Eric B. Laber, Nicholas J. Meyer, Robert Brigantic, Zhen Li","submitted_at":"2018-11-11T20:17:01Z","abstract_excerpt":"Pursuit-evasion is a multi-agent sequential decision problem wherein a group of agents known as pursuers coordinate their traversal of a spatial domain to locate an agent trying to evade them. Pursuit evasion problems arise in a number of import application domains including defense and route planning. Learning to optimally coordinate pursuer behaviors so as to minimize time to capture of the evader is challenging because of a large action space and sparse noisy state information; consequently, previous approaches have relied primarily on heuristics. We propose a variant of Thompson Sampling f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.04471","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:01:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vsunnOHrztyXCMh6eF+1PjWxudX4Lo3vlFlJwTvMQbELakCfqGXZ1vxx93scVLxMsM3VLv57tWWFNpMOPJuXCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:10:19.717728Z"},"content_sha256":"c14f0806325937116680e7cc918cb1f529554e87049b8da2926f2fbf90e41076","schema_version":"1.0","event_id":"sha256:c14f0806325937116680e7cc918cb1f529554e87049b8da2926f2fbf90e41076"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NIDEDYGQBQTA62UUGFWH2GDHR6/bundle.json","state_url":"https://pith.science/pith/NIDEDYGQBQTA62UUGFWH2GDHR6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NIDEDYGQBQTA62UUGFWH2GDHR6/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-28T19:10:19Z","links":{"resolver":"https://pith.science/pith/NIDEDYGQBQTA62UUGFWH2GDHR6","bundle":"https://pith.science/pith/NIDEDYGQBQTA62UUGFWH2GDHR6/bundle.json","state":"https://pith.science/pith/NIDEDYGQBQTA62UUGFWH2GDHR6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NIDEDYGQBQTA62UUGFWH2GDHR6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NIDEDYGQBQTA62UUGFWH2GDHR6","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":"74a674fffa3817a1f0ebec740080d2cf1753c35d9569635871f65d426cf9c808","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-11T20:17:01Z","title_canon_sha256":"0edc78cd9de6e1ac567ed1257058073f26b2c84cfd135d81d4192d2cf508e283"},"schema_version":"1.0","source":{"id":"1811.04471","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.04471","created_at":"2026-05-18T00:01:05Z"},{"alias_kind":"arxiv_version","alias_value":"1811.04471v1","created_at":"2026-05-18T00:01:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.04471","created_at":"2026-05-18T00:01:05Z"},{"alias_kind":"pith_short_12","alias_value":"NIDEDYGQBQTA","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NIDEDYGQBQTA62UU","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NIDEDYGQ","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:c14f0806325937116680e7cc918cb1f529554e87049b8da2926f2fbf90e41076","target":"graph","created_at":"2026-05-18T00:01:05Z","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":"Pursuit-evasion is a multi-agent sequential decision problem wherein a group of agents known as pursuers coordinate their traversal of a spatial domain to locate an agent trying to evade them. Pursuit evasion problems arise in a number of import application domains including defense and route planning. Learning to optimally coordinate pursuer behaviors so as to minimize time to capture of the evader is challenging because of a large action space and sparse noisy state information; consequently, previous approaches have relied primarily on heuristics. We propose a variant of Thompson Sampling f","authors_text":"Eric B. Laber, Nicholas J. Meyer, Robert Brigantic, Zhen Li","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-11T20:17:01Z","title":"Thompson Sampling for Pursuit-Evasion Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.04471","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:9895f31434558737327c75fd200d4e999262cc7ff769ffb4987867de4fe5ad2f","target":"record","created_at":"2026-05-18T00:01:05Z","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":"74a674fffa3817a1f0ebec740080d2cf1753c35d9569635871f65d426cf9c808","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-11T20:17:01Z","title_canon_sha256":"0edc78cd9de6e1ac567ed1257058073f26b2c84cfd135d81d4192d2cf508e283"},"schema_version":"1.0","source":{"id":"1811.04471","kind":"arxiv","version":1}},"canonical_sha256":"6a0641e0d00c260f6a94316c7d18678f99799e601a79598e6da6aca0c5f57754","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a0641e0d00c260f6a94316c7d18678f99799e601a79598e6da6aca0c5f57754","first_computed_at":"2026-05-18T00:01:05.093764Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:05.093764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/FepMC5E2Dfa8gim3XjOv1amJ3YAlFwIKKTGP28UTEEgBfcitMeC0IDGFnMEEHdcJvwyqV7lQuEC3WhXGcQdCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:05.094505Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.04471","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9895f31434558737327c75fd200d4e999262cc7ff769ffb4987867de4fe5ad2f","sha256:c14f0806325937116680e7cc918cb1f529554e87049b8da2926f2fbf90e41076"],"state_sha256":"29114fb1287d889b463f773ed465eeb8b86f6f944f385f866cdc1cbb39bdf735"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W7jMLwaEs8tiXGfcO7Ady8o74OKQac+Imj3o9f4PjlQ2ZD3T+QwUrMVxV+xrSXDK2Kc+zz7WRrdX9tUkPq/WCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T19:10:19.720013Z","bundle_sha256":"bb2d1661242c3a897cd9542d567173db3297361fc18d1a556b6b3ea351bf3342"}}