{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:Q2UTNK7NZAKXEOUNNVJGKOITZL","short_pith_number":"pith:Q2UTNK7N","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"},"canonical_sha256":"86a936abedc815723a8d6d52653913cad343a2dd7e0c3711f40e5b23d36064b3","source":{"kind":"arxiv","id":"2407.02959","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.02959","created_at":"2026-07-05T08:39:44Z"},{"alias_kind":"arxiv_version","alias_value":"2407.02959v1","created_at":"2026-07-05T08:39:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.02959","created_at":"2026-07-05T08:39:44Z"},{"alias_kind":"pith_short_12","alias_value":"Q2UTNK7NZAKX","created_at":"2026-07-05T08:39:44Z"},{"alias_kind":"pith_short_16","alias_value":"Q2UTNK7NZAKXEOUN","created_at":"2026-07-05T08:39:44Z"},{"alias_kind":"pith_short_8","alias_value":"Q2UTNK7N","created_at":"2026-07-05T08:39:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:Q2UTNK7NZAKXEOUNNVJGKOITZL","target":"record","payload":{"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"},"canonical_sha256":"86a936abedc815723a8d6d52653913cad343a2dd7e0c3711f40e5b23d36064b3","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"},"source_kind":"arxiv","source_id":"2407.02959","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-05T08:39:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ilArE9Gp9ixWHa29HkdFagdLtR64REtlDw6a9NzjNLFX6VvYPLsKiiVJnB1guuu7NZQY6NNd7Ps+h6+VuqvDBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T21:27:19.927711Z"},"content_sha256":"7b31659c88b10cad9b4a5831087089052070e998af9c5e39d60e1a85f72f1322","schema_version":"1.0","event_id":"sha256:7b31659c88b10cad9b4a5831087089052070e998af9c5e39d60e1a85f72f1322"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:Q2UTNK7NZAKXEOUNNVJGKOITZL","target":"graph","payload":{"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"},"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-05T08:39:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+aVnvx3mpC9ImN4Ew3LwC47sxlx51Z44sFFkXKQW361dlpFJvRpKEe6vt1PAhx1B2VdvTCj76b5EdaqCSgM1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T21:27:19.928042Z"},"content_sha256":"dbcdb17f205b422692f960d7983bad7dd89a69304d329a410f09e6a97334a03f","schema_version":"1.0","event_id":"sha256:dbcdb17f205b422692f960d7983bad7dd89a69304d329a410f09e6a97334a03f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q2UTNK7NZAKXEOUNNVJGKOITZL/bundle.json","state_url":"https://pith.science/pith/Q2UTNK7NZAKXEOUNNVJGKOITZL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q2UTNK7NZAKXEOUNNVJGKOITZL/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-20T21:27:19Z","links":{"resolver":"https://pith.science/pith/Q2UTNK7NZAKXEOUNNVJGKOITZL","bundle":"https://pith.science/pith/Q2UTNK7NZAKXEOUNNVJGKOITZL/bundle.json","state":"https://pith.science/pith/Q2UTNK7NZAKXEOUNNVJGKOITZL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q2UTNK7NZAKXEOUNNVJGKOITZL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:Q2UTNK7NZAKXEOUNNVJGKOITZL","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":"22e09320cf259ab5db685f0346585bba5cf5da0c4bde93db9b83ea05f903436a","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-07-03T09:52:30Z","title_canon_sha256":"3826b332a6ca93173be409ace6567516ab11cb342918693470ff9c4c3ce4e3b8"},"schema_version":"1.0","source":{"id":"2407.02959","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.02959","created_at":"2026-07-05T08:39:44Z"},{"alias_kind":"arxiv_version","alias_value":"2407.02959v1","created_at":"2026-07-05T08:39:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.02959","created_at":"2026-07-05T08:39:44Z"},{"alias_kind":"pith_short_12","alias_value":"Q2UTNK7NZAKX","created_at":"2026-07-05T08:39:44Z"},{"alias_kind":"pith_short_16","alias_value":"Q2UTNK7NZAKXEOUN","created_at":"2026-07-05T08:39:44Z"},{"alias_kind":"pith_short_8","alias_value":"Q2UTNK7N","created_at":"2026-07-05T08:39:44Z"}],"graph_snapshots":[{"event_id":"sha256:dbcdb17f205b422692f960d7983bad7dd89a69304d329a410f09e6a97334a03f","target":"graph","created_at":"2026-07-05T08:39:44Z","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/2407.02959/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Eduardo \\'Alvarez-Miranda, K\\\"ubra Tan{\\i}nm{\\i}\\c{s}, Markus Sinnl","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-07-03T09:52:30Z","title":"Competing for the most profitable tour: The orienteering interdiction game"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.02959","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:7b31659c88b10cad9b4a5831087089052070e998af9c5e39d60e1a85f72f1322","target":"record","created_at":"2026-07-05T08:39:44Z","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":"22e09320cf259ab5db685f0346585bba5cf5da0c4bde93db9b83ea05f903436a","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-07-03T09:52:30Z","title_canon_sha256":"3826b332a6ca93173be409ace6567516ab11cb342918693470ff9c4c3ce4e3b8"},"schema_version":"1.0","source":{"id":"2407.02959","kind":"arxiv","version":1}},"canonical_sha256":"86a936abedc815723a8d6d52653913cad343a2dd7e0c3711f40e5b23d36064b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86a936abedc815723a8d6d52653913cad343a2dd7e0c3711f40e5b23d36064b3","first_computed_at":"2026-07-05T08:39:44.201098Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:39:44.201098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BS86js1kNCGHjV8W6MHe/4GW5muGpBw9LVKc63TjYMN54fotoOnFCtgXuclTwILGrOUA8PhNSpB6VrzMUeHpAg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:39:44.201527Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.02959","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b31659c88b10cad9b4a5831087089052070e998af9c5e39d60e1a85f72f1322","sha256:dbcdb17f205b422692f960d7983bad7dd89a69304d329a410f09e6a97334a03f"],"state_sha256":"d8b9b1a4ab4d345ab8650285c68998d0b0d282da91b37d31ee061d5ebc0cce06"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SMy7zBNuDs46xCW31Rw7drRWifsBIX4QVW5fXLbBPkx1+3NXqAQsVT6prLQO7Lw/qTUIDQZRH31ek/zGnCYeDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T21:27:19.931277Z","bundle_sha256":"dc193834c70c8d372edc2539089baf751921444af4686fa4e23ef78896eb235b"}}