{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:Q2UTNK7NZAKXEOUNNVJGKOITZL","short_pith_number":"pith:Q2UTNK7N","schema_version":"1.0","canonical_sha256":"86a936abedc815723a8d6d52653913cad343a2dd7e0c3711f40e5b23d36064b3","source":{"kind":"arxiv","id":"2407.02959","version":1},"attestation_state":"computed","paper":{"title":"Competing for the most profitable tour: The orienteering interdiction game","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.OC","authors_text":"Eduardo \\'Alvarez-Miranda, K\\\"ubra Tan{\\i}nm{\\i}\\c{s}, Markus Sinnl","submitted_at":"2024-07-03T09:52:30Z","abstract_excerpt":"The orienteering problem is a well-studied and fundamental problem in transportation science. In the problem, we are given a graph with prizes on the nodes and lengths on the edges, together with a budget on the overall tour length. The goal is to find a tour that respects the length budget and maximizes the collected prizes. In this work, we introduce the orienteering interdiction game, in which a competitor (the leader) tries to minimize the total prize that the follower can collect within a feasible tour. To this end, the leader interdicts some of the nodes so that the follower cannot colle"},"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":"2407.02959","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-07-03T09:52:30Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3826b332a6ca93173be409ace6567516ab11cb342918693470ff9c4c3ce4e3b8","abstract_canon_sha256":"22e09320cf259ab5db685f0346585bba5cf5da0c4bde93db9b83ea05f903436a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:39:44.201527Z","signature_b64":"BS86js1kNCGHjV8W6MHe/4GW5muGpBw9LVKc63TjYMN54fotoOnFCtgXuclTwILGrOUA8PhNSpB6VrzMUeHpAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86a936abedc815723a8d6d52653913cad343a2dd7e0c3711f40e5b23d36064b3","last_reissued_at":"2026-07-05T08:39:44.201098Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:39:44.201098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Competing for the most profitable tour: The orienteering interdiction game","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.OC","authors_text":"Eduardo \\'Alvarez-Miranda, K\\\"ubra Tan{\\i}nm{\\i}\\c{s}, Markus Sinnl","submitted_at":"2024-07-03T09:52:30Z","abstract_excerpt":"The orienteering problem is a well-studied and fundamental problem in transportation science. In the problem, we are given a graph with prizes on the nodes and lengths on the edges, together with a budget on the overall tour length. The goal is to find a tour that respects the length budget and maximizes the collected prizes. In this work, we introduce the orienteering interdiction game, in which a competitor (the leader) tries to minimize the total prize that the follower can collect within a feasible tour. To this end, the leader interdicts some of the nodes so that the follower cannot colle"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.02959","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/2407.02959/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":"2407.02959","created_at":"2026-07-05T08:39:44.201154+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.02959v1","created_at":"2026-07-05T08:39:44.201154+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.02959","created_at":"2026-07-05T08:39:44.201154+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q2UTNK7NZAKX","created_at":"2026-07-05T08:39:44.201154+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q2UTNK7NZAKXEOUN","created_at":"2026-07-05T08:39:44.201154+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q2UTNK7N","created_at":"2026-07-05T08:39:44.201154+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2510.24515","citing_title":"Learning Ordinal Response Policies in Rank-Based Stochastic Prize-Collecting Games","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q2UTNK7NZAKXEOUNNVJGKOITZL","json":"https://pith.science/pith/Q2UTNK7NZAKXEOUNNVJGKOITZL.json","graph_json":"https://pith.science/api/pith-number/Q2UTNK7NZAKXEOUNNVJGKOITZL/graph.json","events_json":"https://pith.science/api/pith-number/Q2UTNK7NZAKXEOUNNVJGKOITZL/events.json","paper":"https://pith.science/paper/Q2UTNK7N"},"agent_actions":{"view_html":"https://pith.science/pith/Q2UTNK7NZAKXEOUNNVJGKOITZL","download_json":"https://pith.science/pith/Q2UTNK7NZAKXEOUNNVJGKOITZL.json","view_paper":"https://pith.science/paper/Q2UTNK7N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.02959&json=true","fetch_graph":"https://pith.science/api/pith-number/Q2UTNK7NZAKXEOUNNVJGKOITZL/graph.json","fetch_events":"https://pith.science/api/pith-number/Q2UTNK7NZAKXEOUNNVJGKOITZL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q2UTNK7NZAKXEOUNNVJGKOITZL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q2UTNK7NZAKXEOUNNVJGKOITZL/action/storage_attestation","attest_author":"https://pith.science/pith/Q2UTNK7NZAKXEOUNNVJGKOITZL/action/author_attestation","sign_citation":"https://pith.science/pith/Q2UTNK7NZAKXEOUNNVJGKOITZL/action/citation_signature","submit_replication":"https://pith.science/pith/Q2UTNK7NZAKXEOUNNVJGKOITZL/action/replication_record"}},"created_at":"2026-07-05T08:39:44.201154+00:00","updated_at":"2026-07-05T08:39:44.201154+00:00"}