{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FLVTS3OW5BX6NGLQFPIJEZFTVU","short_pith_number":"pith:FLVTS3OW","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"},"canonical_sha256":"2aeb396dd6e86fe699702bd09264b3ad2c869b6c8b7e517bb8c46b9549e7ed80","source":{"kind":"arxiv","id":"1612.02135","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.02135","created_at":"2026-05-18T00:55:35Z"},{"alias_kind":"arxiv_version","alias_value":"1612.02135v1","created_at":"2026-05-18T00:55:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.02135","created_at":"2026-05-18T00:55:35Z"},{"alias_kind":"pith_short_12","alias_value":"FLVTS3OW5BX6","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FLVTS3OW5BX6NGLQ","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FLVTS3OW","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FLVTS3OW5BX6NGLQFPIJEZFTVU","target":"record","payload":{"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"},"canonical_sha256":"2aeb396dd6e86fe699702bd09264b3ad2c869b6c8b7e517bb8c46b9549e7ed80","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"},"source_kind":"arxiv","source_id":"1612.02135","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:55:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sAuQj4tSqzByYnLqoheRQF8Llf+MMmGCEBVV6Ba2K9xHrR0p8NB/8dcIx62+l5QyrPeMgS4x4o57hEosXXXuDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:33:42.858024Z"},"content_sha256":"b125ae00bd63e8afaf5308362d2319ae79d87b033938870daad04479f59725ce","schema_version":"1.0","event_id":"sha256:b125ae00bd63e8afaf5308362d2319ae79d87b033938870daad04479f59725ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FLVTS3OW5BX6NGLQFPIJEZFTVU","target":"graph","payload":{"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"},"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:55:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a007CxvADXmEw7sIG3//aIU2xmZ/CWJf9HWjs1Ly/SjFGNBqtqkYCh5zeZKm5JNvqn4LhHtG/amNXuSAeeMcDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:33:42.858932Z"},"content_sha256":"0c59eac211168b794f978d1a389a0910f29915250f3e4373a2a95505c7c674e1","schema_version":"1.0","event_id":"sha256:0c59eac211168b794f978d1a389a0910f29915250f3e4373a2a95505c7c674e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FLVTS3OW5BX6NGLQFPIJEZFTVU/bundle.json","state_url":"https://pith.science/pith/FLVTS3OW5BX6NGLQFPIJEZFTVU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FLVTS3OW5BX6NGLQFPIJEZFTVU/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-31T22:33:42Z","links":{"resolver":"https://pith.science/pith/FLVTS3OW5BX6NGLQFPIJEZFTVU","bundle":"https://pith.science/pith/FLVTS3OW5BX6NGLQFPIJEZFTVU/bundle.json","state":"https://pith.science/pith/FLVTS3OW5BX6NGLQFPIJEZFTVU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FLVTS3OW5BX6NGLQFPIJEZFTVU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FLVTS3OW5BX6NGLQFPIJEZFTVU","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":"1dc4b6f1168929e041a6bfd29ab81340b374e03b89b3c8f6ec7ca04f84aa7757","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-12-07T07:34:35Z","title_canon_sha256":"fa780138d02bfa506d9080b82feb7edfbbee042e5804163aadf2365b05fb03d1"},"schema_version":"1.0","source":{"id":"1612.02135","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.02135","created_at":"2026-05-18T00:55:35Z"},{"alias_kind":"arxiv_version","alias_value":"1612.02135v1","created_at":"2026-05-18T00:55:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.02135","created_at":"2026-05-18T00:55:35Z"},{"alias_kind":"pith_short_12","alias_value":"FLVTS3OW5BX6","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FLVTS3OW5BX6NGLQ","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FLVTS3OW","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:0c59eac211168b794f978d1a389a0910f29915250f3e4373a2a95505c7c674e1","target":"graph","created_at":"2026-05-18T00:55:35Z","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 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","authors_text":"Aude Marzuoli, Emmanuel Boidot, Eric Feron","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-12-07T07:34:35Z","title":"Discrete and Continuous ambush games: optimal policies and approximate solutions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.02135","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:b125ae00bd63e8afaf5308362d2319ae79d87b033938870daad04479f59725ce","target":"record","created_at":"2026-05-18T00:55:35Z","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":"1dc4b6f1168929e041a6bfd29ab81340b374e03b89b3c8f6ec7ca04f84aa7757","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-12-07T07:34:35Z","title_canon_sha256":"fa780138d02bfa506d9080b82feb7edfbbee042e5804163aadf2365b05fb03d1"},"schema_version":"1.0","source":{"id":"1612.02135","kind":"arxiv","version":1}},"canonical_sha256":"2aeb396dd6e86fe699702bd09264b3ad2c869b6c8b7e517bb8c46b9549e7ed80","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2aeb396dd6e86fe699702bd09264b3ad2c869b6c8b7e517bb8c46b9549e7ed80","first_computed_at":"2026-05-18T00:55:35.269779Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:35.269779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T8glgETUPKoKmGhhIRFwNcyRdUbCuc0qkmgxgExwVXWjUfyTxRJswdoIoqMH/qNm15YF2L/GqhYAAl/m+NlFDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:35.270342Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.02135","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b125ae00bd63e8afaf5308362d2319ae79d87b033938870daad04479f59725ce","sha256:0c59eac211168b794f978d1a389a0910f29915250f3e4373a2a95505c7c674e1"],"state_sha256":"eeda06e6c5c8dba884722fedacf8de2ab5b6f25d7988d4b87ec494c90263ca25"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oJl7i8j3PtCaWWFcVS2Vzz7Cb5pL3RN4CCre9IgubNrN6W2/RAGIlxcUGwKNX7J7LIBF6ynJK+J+PuSeNezgAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T22:33:42.863456Z","bundle_sha256":"34fb5a39f6eac1f90230112f85e754ea366aba9f2c88b938578f725c7279adca"}}