{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:Z3QJIDQDV7PMTADDDTW2B4VVOS","short_pith_number":"pith:Z3QJIDQD","schema_version":"1.0","canonical_sha256":"cee0940e03afdec980631ceda0f2b57490157097264bfdd41929d024163f39fe","source":{"kind":"arxiv","id":"2508.10189","version":1},"attestation_state":"computed","paper":{"title":"Contested Route Planning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Christian Kroer, Garud Iyengar, Jakub \\v{C}ern\\'y","submitted_at":"2025-08-13T20:54:07Z","abstract_excerpt":"We consider the problem of routing for logistics purposes, in a contested environment where an adversary attempts to disrupt the vehicle along the chosen route. We construct a game-theoretic model that captures the problem of optimal routing in such an environment. While basic robust deterministic routing plans are already challenging to devise, they tend to be predictable, which can limit their effectiveness. By introducing calculated randomness via modeling the route planning process as a two-player zero-sum game, we compute immediately deployable plans that are diversified and harder to ant"},"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":"2508.10189","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-08-13T20:54:07Z","cross_cats_sorted":[],"title_canon_sha256":"da5d973a8fc14220ed510e58905d74d851294f71da453931a6b9b5c43de30ac5","abstract_canon_sha256":"7077fe13a48fd6981b8f30099f5359f683b28a432437ae63eae55d9e5f812e9c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:53:33.135859Z","signature_b64":"jvbJwRZAFhzdJVJuJH+Bykj1Gi8jd4vD7JadH0huIFYW79gzcBEx3PAGRngddR7JFnj7tCh/PtBSx/p9MajiBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cee0940e03afdec980631ceda0f2b57490157097264bfdd41929d024163f39fe","last_reissued_at":"2026-07-05T11:53:33.135384Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:53:33.135384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Contested Route Planning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Christian Kroer, Garud Iyengar, Jakub \\v{C}ern\\'y","submitted_at":"2025-08-13T20:54:07Z","abstract_excerpt":"We consider the problem of routing for logistics purposes, in a contested environment where an adversary attempts to disrupt the vehicle along the chosen route. We construct a game-theoretic model that captures the problem of optimal routing in such an environment. While basic robust deterministic routing plans are already challenging to devise, they tend to be predictable, which can limit their effectiveness. By introducing calculated randomness via modeling the route planning process as a two-player zero-sum game, we compute immediately deployable plans that are diversified and harder to ant"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.10189","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.10189/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2508.10189","created_at":"2026-07-05T11:53:33.135439+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.10189v1","created_at":"2026-07-05T11:53:33.135439+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.10189","created_at":"2026-07-05T11:53:33.135439+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z3QJIDQDV7PM","created_at":"2026-07-05T11:53:33.135439+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z3QJIDQDV7PMTADD","created_at":"2026-07-05T11:53:33.135439+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z3QJIDQD","created_at":"2026-07-05T11:53:33.135439+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/Z3QJIDQDV7PMTADDDTW2B4VVOS","json":"https://pith.science/pith/Z3QJIDQDV7PMTADDDTW2B4VVOS.json","graph_json":"https://pith.science/api/pith-number/Z3QJIDQDV7PMTADDDTW2B4VVOS/graph.json","events_json":"https://pith.science/api/pith-number/Z3QJIDQDV7PMTADDDTW2B4VVOS/events.json","paper":"https://pith.science/paper/Z3QJIDQD"},"agent_actions":{"view_html":"https://pith.science/pith/Z3QJIDQDV7PMTADDDTW2B4VVOS","download_json":"https://pith.science/pith/Z3QJIDQDV7PMTADDDTW2B4VVOS.json","view_paper":"https://pith.science/paper/Z3QJIDQD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.10189&json=true","fetch_graph":"https://pith.science/api/pith-number/Z3QJIDQDV7PMTADDDTW2B4VVOS/graph.json","fetch_events":"https://pith.science/api/pith-number/Z3QJIDQDV7PMTADDDTW2B4VVOS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z3QJIDQDV7PMTADDDTW2B4VVOS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z3QJIDQDV7PMTADDDTW2B4VVOS/action/storage_attestation","attest_author":"https://pith.science/pith/Z3QJIDQDV7PMTADDDTW2B4VVOS/action/author_attestation","sign_citation":"https://pith.science/pith/Z3QJIDQDV7PMTADDDTW2B4VVOS/action/citation_signature","submit_replication":"https://pith.science/pith/Z3QJIDQDV7PMTADDDTW2B4VVOS/action/replication_record"}},"created_at":"2026-07-05T11:53:33.135439+00:00","updated_at":"2026-07-05T11:53:33.135439+00:00"}