{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JRE7QVPVXFTPRV7PD4MQHJNMK7","short_pith_number":"pith:JRE7QVPV","schema_version":"1.0","canonical_sha256":"4c49f855f5b966f8d7ef1f1903a5ac57dbfbe7e5d040ee7539d8367549c3c52d","source":{"kind":"arxiv","id":"1408.6127","version":1},"attestation_state":"computed","paper":{"title":"A Complete framework for ambush avoidance in realistic environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Aude Marzuoli, Emmanuel Boidot, Eric Feron","submitted_at":"2014-08-26T14:33:53Z","abstract_excerpt":"Operating vehicles in adversarial environments between a recurring origin-destination pair requires new planning techniques. A two players zero-sum game is introduced. The goal of the first player is to minimize the expected casualties undergone by a convoy. The goal of the second player is to maximize this damage. The outcome of the game is obtained via a linear program that solves the corresponding minmax optimization problem over this outcome. Different environment models are defined in order to compute routing strategies over unstructured environments. To compare these methods for increasi"},"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":"1408.6127","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-08-26T14:33:53Z","cross_cats_sorted":[],"title_canon_sha256":"0345a56c6201ce34d722b34acbbc5590c3083baf4dd21c781d677a65fe906e10","abstract_canon_sha256":"46ee4634cb5ba6aa90978c0cf39c0784ddb1f3bc2b85b6af47e246ece25c1f56"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:09.402821Z","signature_b64":"6hhIwcsNNnfDn1SV0AjEAC1dc0WiBljKUDDClc+n7PH4y6Gcc/DbevRe28Qb84ury5cyOqAA/blHUN6c31P8Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c49f855f5b966f8d7ef1f1903a5ac57dbfbe7e5d040ee7539d8367549c3c52d","last_reissued_at":"2026-05-18T02:44:09.402386Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:09.402386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Complete framework for ambush avoidance in realistic environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Aude Marzuoli, Emmanuel Boidot, Eric Feron","submitted_at":"2014-08-26T14:33:53Z","abstract_excerpt":"Operating vehicles in adversarial environments between a recurring origin-destination pair requires new planning techniques. A two players zero-sum game is introduced. The goal of the first player is to minimize the expected casualties undergone by a convoy. The goal of the second player is to maximize this damage. The outcome of the game is obtained via a linear program that solves the corresponding minmax optimization problem over this outcome. Different environment models are defined in order to compute routing strategies over unstructured environments. To compare these methods for increasi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.6127","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":"1408.6127","created_at":"2026-05-18T02:44:09.402447+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.6127v1","created_at":"2026-05-18T02:44:09.402447+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.6127","created_at":"2026-05-18T02:44:09.402447+00:00"},{"alias_kind":"pith_short_12","alias_value":"JRE7QVPVXFTP","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"JRE7QVPVXFTPRV7P","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"JRE7QVPV","created_at":"2026-05-18T12:28:35.611951+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/JRE7QVPVXFTPRV7PD4MQHJNMK7","json":"https://pith.science/pith/JRE7QVPVXFTPRV7PD4MQHJNMK7.json","graph_json":"https://pith.science/api/pith-number/JRE7QVPVXFTPRV7PD4MQHJNMK7/graph.json","events_json":"https://pith.science/api/pith-number/JRE7QVPVXFTPRV7PD4MQHJNMK7/events.json","paper":"https://pith.science/paper/JRE7QVPV"},"agent_actions":{"view_html":"https://pith.science/pith/JRE7QVPVXFTPRV7PD4MQHJNMK7","download_json":"https://pith.science/pith/JRE7QVPVXFTPRV7PD4MQHJNMK7.json","view_paper":"https://pith.science/paper/JRE7QVPV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.6127&json=true","fetch_graph":"https://pith.science/api/pith-number/JRE7QVPVXFTPRV7PD4MQHJNMK7/graph.json","fetch_events":"https://pith.science/api/pith-number/JRE7QVPVXFTPRV7PD4MQHJNMK7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JRE7QVPVXFTPRV7PD4MQHJNMK7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JRE7QVPVXFTPRV7PD4MQHJNMK7/action/storage_attestation","attest_author":"https://pith.science/pith/JRE7QVPVXFTPRV7PD4MQHJNMK7/action/author_attestation","sign_citation":"https://pith.science/pith/JRE7QVPVXFTPRV7PD4MQHJNMK7/action/citation_signature","submit_replication":"https://pith.science/pith/JRE7QVPVXFTPRV7PD4MQHJNMK7/action/replication_record"}},"created_at":"2026-05-18T02:44:09.402447+00:00","updated_at":"2026-05-18T02:44:09.402447+00:00"}