{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ARKURCR534QWVBSRT2KWWKUGM3","short_pith_number":"pith:ARKURCR5","schema_version":"1.0","canonical_sha256":"0455488a3ddf216a86519e956b2a8666e306881952fff1e4f7f340aa8af2374b","source":{"kind":"arxiv","id":"2607.04497","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.04497","created_at":"2026-07-07T02:19:22.138708+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.04497v1","created_at":"2026-07-07T02:19:22.138708+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.04497","created_at":"2026-07-07T02:19:22.138708+00:00"},{"alias_kind":"pith_short_12","alias_value":"ARKURCR534QW","created_at":"2026-07-07T02:19:22.138708+00:00"},{"alias_kind":"pith_short_16","alias_value":"ARKURCR534QWVBSR","created_at":"2026-07-07T02:19:22.138708+00:00"},{"alias_kind":"pith_short_8","alias_value":"ARKURCR5","created_at":"2026-07-07T02:19:22.138708+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/ARKURCR534QWVBSRT2KWWKUGM3","json":"https://pith.science/pith/ARKURCR534QWVBSRT2KWWKUGM3.json","graph_json":"https://pith.science/api/pith-number/ARKURCR534QWVBSRT2KWWKUGM3/graph.json","events_json":"https://pith.science/api/pith-number/ARKURCR534QWVBSRT2KWWKUGM3/events.json","paper":"https://pith.science/paper/ARKURCR5"},"agent_actions":{"view_html":"https://pith.science/pith/ARKURCR534QWVBSRT2KWWKUGM3","download_json":"https://pith.science/pith/ARKURCR534QWVBSRT2KWWKUGM3.json","view_paper":"https://pith.science/paper/ARKURCR5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.04497&json=true","fetch_graph":"https://pith.science/api/pith-number/ARKURCR534QWVBSRT2KWWKUGM3/graph.json","fetch_events":"https://pith.science/api/pith-number/ARKURCR534QWVBSRT2KWWKUGM3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ARKURCR534QWVBSRT2KWWKUGM3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ARKURCR534QWVBSRT2KWWKUGM3/action/storage_attestation","attest_author":"https://pith.science/pith/ARKURCR534QWVBSRT2KWWKUGM3/action/author_attestation","sign_citation":"https://pith.science/pith/ARKURCR534QWVBSRT2KWWKUGM3/action/citation_signature","submit_replication":"https://pith.science/pith/ARKURCR534QWVBSRT2KWWKUGM3/action/replication_record"}},"created_at":"2026-07-07T02:19:22.138708+00:00","updated_at":"2026-07-07T02:19:22.138708+00:00"}