{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ARKURCR534QWVBSRT2KWWKUGM3","short_pith_number":"pith:ARKURCR5","canonical_record":{"source":{"id":"2607.04497","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-05T20:47:08Z","cross_cats_sorted":["cs.DS","cs.MS"],"title_canon_sha256":"cc56d525035adb804d06e74b6825c4203a0ae8f4da5c89d9b95ebf538d2dc642","abstract_canon_sha256":"37e21d41f91f1989e867b96e6ddd9de52c4a0b384bf49063114284534ad610bd"},"schema_version":"1.0"},"canonical_sha256":"0455488a3ddf216a86519e956b2a8666e306881952fff1e4f7f340aa8af2374b","source":{"kind":"arxiv","id":"2607.04497","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.04497","created_at":"2026-07-07T02:19:22Z"},{"alias_kind":"arxiv_version","alias_value":"2607.04497v1","created_at":"2026-07-07T02:19:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.04497","created_at":"2026-07-07T02:19:22Z"},{"alias_kind":"pith_short_12","alias_value":"ARKURCR534QW","created_at":"2026-07-07T02:19:22Z"},{"alias_kind":"pith_short_16","alias_value":"ARKURCR534QWVBSR","created_at":"2026-07-07T02:19:22Z"},{"alias_kind":"pith_short_8","alias_value":"ARKURCR5","created_at":"2026-07-07T02:19:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ARKURCR534QWVBSRT2KWWKUGM3","target":"record","payload":{"canonical_record":{"source":{"id":"2607.04497","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-05T20:47:08Z","cross_cats_sorted":["cs.DS","cs.MS"],"title_canon_sha256":"cc56d525035adb804d06e74b6825c4203a0ae8f4da5c89d9b95ebf538d2dc642","abstract_canon_sha256":"37e21d41f91f1989e867b96e6ddd9de52c4a0b384bf49063114284534ad610bd"},"schema_version":"1.0"},"canonical_sha256":"0455488a3ddf216a86519e956b2a8666e306881952fff1e4f7f340aa8af2374b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T02:19:22.139345Z","signature_b64":"82iKl3fM/0LKFQ6M3M9BUPlN6dR8/snuZKPVZ9e07qIP3N6Zm5R0Z8U5qHAmWAjF5ig6E6fTgBdi3uRONbAsCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0455488a3ddf216a86519e956b2a8666e306881952fff1e4f7f340aa8af2374b","last_reissued_at":"2026-07-07T02:19:22.138601Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T02:19:22.138601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.04497","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-07T02:19:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+NIB7albKVuH62AaMSS9HyxAVLix4nmmcQiiAKoq928zlwDgU7tBQnoK8m2kYrZAMLExO/O3MVx+EIkyohGgBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T05:42:19.744486Z"},"content_sha256":"88158ae72484d5817ec01e9044769865a29dd02628192cb058478be448dc10f4","schema_version":"1.0","event_id":"sha256:88158ae72484d5817ec01e9044769865a29dd02628192cb058478be448dc10f4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ARKURCR534QWVBSRT2KWWKUGM3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","cs.MS"],"primary_cat":"math.OC","authors_text":"Simon Spoorendonk","submitted_at":"2026-07-05T20:47:08Z","abstract_excerpt":"We present an open, reproducible branch-and-cut (B&C) algorithm for the capacitated profitable tour problem (CPTP) and its open s-t path variant, the capacity-constrained elementary shortest-path problem. The solver re-implements the formulation and cut families of Jepsen et al. (2014) on a fully open mixed-integer programming stack (HiGHS; Huangfu and Hall, 2018), and adds bound-based preprocessing, domain propagation, and reduced-cost variable fixing. We claim no new method; the contribution is twofold. First, an open, reproducible artifact: to our knowledge the first branch-and-cut for this"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.04497","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/2607.04497/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-07T02:19:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TSQmYE1bEwrX3NV0RUIbuMOVzkl1JGYHQTM4G9IYreyqZ84npPKu/Fc46tBmzKTxSlwz+FEpHiIctepnexFaCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T05:42:19.744907Z"},"content_sha256":"ddaa596a3a9afe58f40f2e762ac8224878437d4c2efcd7bcaabbee81909c8aeb","schema_version":"1.0","event_id":"sha256:ddaa596a3a9afe58f40f2e762ac8224878437d4c2efcd7bcaabbee81909c8aeb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ARKURCR534QWVBSRT2KWWKUGM3/bundle.json","state_url":"https://pith.science/pith/ARKURCR534QWVBSRT2KWWKUGM3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ARKURCR534QWVBSRT2KWWKUGM3/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-13T05:42:19Z","links":{"resolver":"https://pith.science/pith/ARKURCR534QWVBSRT2KWWKUGM3","bundle":"https://pith.science/pith/ARKURCR534QWVBSRT2KWWKUGM3/bundle.json","state":"https://pith.science/pith/ARKURCR534QWVBSRT2KWWKUGM3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ARKURCR534QWVBSRT2KWWKUGM3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ARKURCR534QWVBSRT2KWWKUGM3","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":"37e21d41f91f1989e867b96e6ddd9de52c4a0b384bf49063114284534ad610bd","cross_cats_sorted":["cs.DS","cs.MS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-05T20:47:08Z","title_canon_sha256":"cc56d525035adb804d06e74b6825c4203a0ae8f4da5c89d9b95ebf538d2dc642"},"schema_version":"1.0","source":{"id":"2607.04497","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.04497","created_at":"2026-07-07T02:19:22Z"},{"alias_kind":"arxiv_version","alias_value":"2607.04497v1","created_at":"2026-07-07T02:19:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.04497","created_at":"2026-07-07T02:19:22Z"},{"alias_kind":"pith_short_12","alias_value":"ARKURCR534QW","created_at":"2026-07-07T02:19:22Z"},{"alias_kind":"pith_short_16","alias_value":"ARKURCR534QWVBSR","created_at":"2026-07-07T02:19:22Z"},{"alias_kind":"pith_short_8","alias_value":"ARKURCR5","created_at":"2026-07-07T02:19:22Z"}],"graph_snapshots":[{"event_id":"sha256:ddaa596a3a9afe58f40f2e762ac8224878437d4c2efcd7bcaabbee81909c8aeb","target":"graph","created_at":"2026-07-07T02:19:22Z","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/2607.04497/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present an open, reproducible branch-and-cut (B&C) algorithm for the capacitated profitable tour problem (CPTP) and its open s-t path variant, the capacity-constrained elementary shortest-path problem. The solver re-implements the formulation and cut families of Jepsen et al. (2014) on a fully open mixed-integer programming stack (HiGHS; Huangfu and Hall, 2018), and adds bound-based preprocessing, domain propagation, and reduced-cost variable fixing. We claim no new method; the contribution is twofold. First, an open, reproducible artifact: to our knowledge the first branch-and-cut for this","authors_text":"Simon Spoorendonk","cross_cats":["cs.DS","cs.MS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-05T20:47:08Z","title":"An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.04497","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:88158ae72484d5817ec01e9044769865a29dd02628192cb058478be448dc10f4","target":"record","created_at":"2026-07-07T02:19:22Z","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":"37e21d41f91f1989e867b96e6ddd9de52c4a0b384bf49063114284534ad610bd","cross_cats_sorted":["cs.DS","cs.MS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-05T20:47:08Z","title_canon_sha256":"cc56d525035adb804d06e74b6825c4203a0ae8f4da5c89d9b95ebf538d2dc642"},"schema_version":"1.0","source":{"id":"2607.04497","kind":"arxiv","version":1}},"canonical_sha256":"0455488a3ddf216a86519e956b2a8666e306881952fff1e4f7f340aa8af2374b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0455488a3ddf216a86519e956b2a8666e306881952fff1e4f7f340aa8af2374b","first_computed_at":"2026-07-07T02:19:22.138601Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-07T02:19:22.138601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"82iKl3fM/0LKFQ6M3M9BUPlN6dR8/snuZKPVZ9e07qIP3N6Zm5R0Z8U5qHAmWAjF5ig6E6fTgBdi3uRONbAsCg==","signature_status":"signed_v1","signed_at":"2026-07-07T02:19:22.139345Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.04497","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:88158ae72484d5817ec01e9044769865a29dd02628192cb058478be448dc10f4","sha256:ddaa596a3a9afe58f40f2e762ac8224878437d4c2efcd7bcaabbee81909c8aeb"],"state_sha256":"7664d907fe82223aabc09fcba514940d49c2e006b7edf89f6abf3c611d03b7d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BSLt7XW/ToI+Lex6S8YbzsDODwZHsez0czY+VMEzN+ZCxOMfsdH3pX4EWRZvh1hpErUE3CXVwTJgz3XrIcPIAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T05:42:19.747745Z","bundle_sha256":"f3b15ea6e728ba4d310ed00bb45d5a21c238fe46ba0bdc7dfdb65bbb105fc13b"}}