{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:FLVTS3OW5BX6NGLQFPIJEZFTVU","short_pith_number":"pith:FLVTS3OW","schema_version":"1.0","canonical_sha256":"2aeb396dd6e86fe699702bd09264b3ad2c869b6c8b7e517bb8c46b9549e7ed80","source":{"kind":"arxiv","id":"1612.02135","version":1},"attestation_state":"computed","paper":{"title":"Discrete and Continuous ambush games: optimal policies and approximate solutions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Aude Marzuoli, Emmanuel Boidot, Eric Feron","submitted_at":"2016-12-07T07:34:35Z","abstract_excerpt":"We consider an autonomous navigation problem, whereby a traveler aims at traversing an environment in which an adversary tries to set an ambush. A two players zero sum game is introduced. Players' strategies are computed as random path distributions, a  realization of which is the path chosen by the traveler. A parallel is drawn between the discrete problem, where the traveler moves on a network, and the continuous problem, where the traveler moves in the plane. Analytical optimal policies are derived. Using assumptions from the Minimal Cut - Maximal Flow literature, the optimal value of the g"},"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":"1612.02135","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-12-07T07:34:35Z","cross_cats_sorted":[],"title_canon_sha256":"fa780138d02bfa506d9080b82feb7edfbbee042e5804163aadf2365b05fb03d1","abstract_canon_sha256":"1dc4b6f1168929e041a6bfd29ab81340b374e03b89b3c8f6ec7ca04f84aa7757"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:35.270342Z","signature_b64":"T8glgETUPKoKmGhhIRFwNcyRdUbCuc0qkmgxgExwVXWjUfyTxRJswdoIoqMH/qNm15YF2L/GqhYAAl/m+NlFDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2aeb396dd6e86fe699702bd09264b3ad2c869b6c8b7e517bb8c46b9549e7ed80","last_reissued_at":"2026-05-18T00:55:35.269779Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:35.269779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Discrete and Continuous ambush games: optimal policies and approximate solutions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Aude Marzuoli, Emmanuel Boidot, Eric Feron","submitted_at":"2016-12-07T07:34:35Z","abstract_excerpt":"We consider an autonomous navigation problem, whereby a traveler aims at traversing an environment in which an adversary tries to set an ambush. A two players zero sum game is introduced. Players' strategies are computed as random path distributions, a  realization of which is the path chosen by the traveler. A parallel is drawn between the discrete problem, where the traveler moves on a network, and the continuous problem, where the traveler moves in the plane. Analytical optimal policies are derived. Using assumptions from the Minimal Cut - Maximal Flow literature, the optimal value of the g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.02135","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1612.02135","created_at":"2026-05-18T00:55:35.269867+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.02135v1","created_at":"2026-05-18T00:55:35.269867+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.02135","created_at":"2026-05-18T00:55:35.269867+00:00"},{"alias_kind":"pith_short_12","alias_value":"FLVTS3OW5BX6","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"FLVTS3OW5BX6NGLQ","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"FLVTS3OW","created_at":"2026-05-18T12:30:15.759754+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/FLVTS3OW5BX6NGLQFPIJEZFTVU","json":"https://pith.science/pith/FLVTS3OW5BX6NGLQFPIJEZFTVU.json","graph_json":"https://pith.science/api/pith-number/FLVTS3OW5BX6NGLQFPIJEZFTVU/graph.json","events_json":"https://pith.science/api/pith-number/FLVTS3OW5BX6NGLQFPIJEZFTVU/events.json","paper":"https://pith.science/paper/FLVTS3OW"},"agent_actions":{"view_html":"https://pith.science/pith/FLVTS3OW5BX6NGLQFPIJEZFTVU","download_json":"https://pith.science/pith/FLVTS3OW5BX6NGLQFPIJEZFTVU.json","view_paper":"https://pith.science/paper/FLVTS3OW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.02135&json=true","fetch_graph":"https://pith.science/api/pith-number/FLVTS3OW5BX6NGLQFPIJEZFTVU/graph.json","fetch_events":"https://pith.science/api/pith-number/FLVTS3OW5BX6NGLQFPIJEZFTVU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FLVTS3OW5BX6NGLQFPIJEZFTVU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FLVTS3OW5BX6NGLQFPIJEZFTVU/action/storage_attestation","attest_author":"https://pith.science/pith/FLVTS3OW5BX6NGLQFPIJEZFTVU/action/author_attestation","sign_citation":"https://pith.science/pith/FLVTS3OW5BX6NGLQFPIJEZFTVU/action/citation_signature","submit_replication":"https://pith.science/pith/FLVTS3OW5BX6NGLQFPIJEZFTVU/action/replication_record"}},"created_at":"2026-05-18T00:55:35.269867+00:00","updated_at":"2026-05-18T00:55:35.269867+00:00"}