{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:Z3QJIDQDV7PMTADDDTW2B4VVOS","short_pith_number":"pith:Z3QJIDQD","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"},"canonical_sha256":"cee0940e03afdec980631ceda0f2b57490157097264bfdd41929d024163f39fe","source":{"kind":"arxiv","id":"2508.10189","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.10189","created_at":"2026-07-05T11:53:33Z"},{"alias_kind":"arxiv_version","alias_value":"2508.10189v1","created_at":"2026-07-05T11:53:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.10189","created_at":"2026-07-05T11:53:33Z"},{"alias_kind":"pith_short_12","alias_value":"Z3QJIDQDV7PM","created_at":"2026-07-05T11:53:33Z"},{"alias_kind":"pith_short_16","alias_value":"Z3QJIDQDV7PMTADD","created_at":"2026-07-05T11:53:33Z"},{"alias_kind":"pith_short_8","alias_value":"Z3QJIDQD","created_at":"2026-07-05T11:53:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:Z3QJIDQDV7PMTADDDTW2B4VVOS","target":"record","payload":{"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"},"canonical_sha256":"cee0940e03afdec980631ceda0f2b57490157097264bfdd41929d024163f39fe","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"},"source_kind":"arxiv","source_id":"2508.10189","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-07-05T11:53:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aaLc/QhiPhr2xd+GdGiXryZm3P7yywvP5f8qjUmeirLJCz4wscIORN/O9hPwR/N60DwgmMECVc/2Ccsm3DFoBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T02:53:07.348963Z"},"content_sha256":"090f503d045722581ca618884f4265c593a103222345d9f4efae5ed8692b91d3","schema_version":"1.0","event_id":"sha256:090f503d045722581ca618884f4265c593a103222345d9f4efae5ed8692b91d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:Z3QJIDQDV7PMTADDDTW2B4VVOS","target":"graph","payload":{"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"},"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-07-05T11:53:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ULyOWAzbbxHzdJ9CZYHHfhY488ce2U71mMJ4vnfQc315n3TK5gUOHSskOYhByQ3gi+vCa+zPA2p47GgyaFwoAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T02:53:07.349472Z"},"content_sha256":"07e8e3de1e847c444485bce26fe721eb9a4f7f49070c94489d38ef08965f817f","schema_version":"1.0","event_id":"sha256:07e8e3de1e847c444485bce26fe721eb9a4f7f49070c94489d38ef08965f817f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z3QJIDQDV7PMTADDDTW2B4VVOS/bundle.json","state_url":"https://pith.science/pith/Z3QJIDQDV7PMTADDDTW2B4VVOS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z3QJIDQDV7PMTADDDTW2B4VVOS/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-08-09T02:53:07Z","links":{"resolver":"https://pith.science/pith/Z3QJIDQDV7PMTADDDTW2B4VVOS","bundle":"https://pith.science/pith/Z3QJIDQDV7PMTADDDTW2B4VVOS/bundle.json","state":"https://pith.science/pith/Z3QJIDQDV7PMTADDDTW2B4VVOS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z3QJIDQDV7PMTADDDTW2B4VVOS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:Z3QJIDQDV7PMTADDDTW2B4VVOS","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":"7077fe13a48fd6981b8f30099f5359f683b28a432437ae63eae55d9e5f812e9c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-08-13T20:54:07Z","title_canon_sha256":"da5d973a8fc14220ed510e58905d74d851294f71da453931a6b9b5c43de30ac5"},"schema_version":"1.0","source":{"id":"2508.10189","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.10189","created_at":"2026-07-05T11:53:33Z"},{"alias_kind":"arxiv_version","alias_value":"2508.10189v1","created_at":"2026-07-05T11:53:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.10189","created_at":"2026-07-05T11:53:33Z"},{"alias_kind":"pith_short_12","alias_value":"Z3QJIDQDV7PM","created_at":"2026-07-05T11:53:33Z"},{"alias_kind":"pith_short_16","alias_value":"Z3QJIDQDV7PMTADD","created_at":"2026-07-05T11:53:33Z"},{"alias_kind":"pith_short_8","alias_value":"Z3QJIDQD","created_at":"2026-07-05T11:53:33Z"}],"graph_snapshots":[{"event_id":"sha256:07e8e3de1e847c444485bce26fe721eb9a4f7f49070c94489d38ef08965f817f","target":"graph","created_at":"2026-07-05T11:53:33Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2508.10189/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Christian Kroer, Garud Iyengar, Jakub \\v{C}ern\\'y","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.10189","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:090f503d045722581ca618884f4265c593a103222345d9f4efae5ed8692b91d3","target":"record","created_at":"2026-07-05T11:53:33Z","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":"7077fe13a48fd6981b8f30099f5359f683b28a432437ae63eae55d9e5f812e9c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-08-13T20:54:07Z","title_canon_sha256":"da5d973a8fc14220ed510e58905d74d851294f71da453931a6b9b5c43de30ac5"},"schema_version":"1.0","source":{"id":"2508.10189","kind":"arxiv","version":1}},"canonical_sha256":"cee0940e03afdec980631ceda0f2b57490157097264bfdd41929d024163f39fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cee0940e03afdec980631ceda0f2b57490157097264bfdd41929d024163f39fe","first_computed_at":"2026-07-05T11:53:33.135384Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:53:33.135384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jvbJwRZAFhzdJVJuJH+Bykj1Gi8jd4vD7JadH0huIFYW79gzcBEx3PAGRngddR7JFnj7tCh/PtBSx/p9MajiBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:53:33.135859Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.10189","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:090f503d045722581ca618884f4265c593a103222345d9f4efae5ed8692b91d3","sha256:07e8e3de1e847c444485bce26fe721eb9a4f7f49070c94489d38ef08965f817f"],"state_sha256":"2357e516ead0480771796525269e2ce39919dfb09f5df563f12bd6ca75712074"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RusOLaFPHM+nlZ7CWO7BiJsZ1I2yXagoTKitPi3Hd550XosoIXNSV7yvBtdz22Wg+j6fC8BaYskIVkEG2u1BDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T02:53:07.352838Z","bundle_sha256":"a385485932930c4dad515ee06ef50dde525f74acb9a0a9a34086a9a07eae925c"}}