{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:5EJQTIV7GXBSW3OZXKWZE3TS6N","short_pith_number":"pith:5EJQTIV7","schema_version":"1.0","canonical_sha256":"e91309a2bf35c32b6dd9baad926e72f34aec187688873dca1cf5fdf1188f186b","source":{"kind":"arxiv","id":"2606.18157","version":1},"attestation_state":"computed","paper":{"title":"Reducing Prize-Collecting Stroll and Related Routing Problems to Prize-Collecting TSP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hong Li","submitted_at":"2026-06-16T16:56:03Z","abstract_excerpt":"The prize-collecting stroll is the path version of the prize-collecting TSP. Given a complete metric graph, two prescribed terminal vertices $s,t$, and nonnegative penalties on vertices, the prize-collecting stroll asks for an $s$-$t$ tour minimizing the length of the tour plus the total penalty of vertices that are not visited by the $s,t$ tour. We study a common generalization of the prize-collecting stroll and several related prize-collecting routing problems, which we call the prize-collecting-$\\Phi$-TSP. In this model, $\\Phi$ specifies a set of prescribed vertices alongside their parity a"},"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":"2606.18157","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-16T16:56:03Z","cross_cats_sorted":[],"title_canon_sha256":"123926b58868f3abf1503a856c59ce501c061b8958543f1d24941b752b4f6df8","abstract_canon_sha256":"78b224f096dd505b74928914852607f3214d36ce355e6a4e144bfdd6e55d15bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:10:49.750211Z","signature_b64":"e6p0ygPQYkBf1ONB3d5N2b5FezXfyv/wZSX4B7QuFQWbpIl3izg8Ht+pBArviAspWXlr8gZ2JA+IUBL0qAYyAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e91309a2bf35c32b6dd9baad926e72f34aec187688873dca1cf5fdf1188f186b","last_reissued_at":"2026-06-19T16:10:49.749863Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:10:49.749863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reducing Prize-Collecting Stroll and Related Routing Problems to Prize-Collecting TSP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hong Li","submitted_at":"2026-06-16T16:56:03Z","abstract_excerpt":"The prize-collecting stroll is the path version of the prize-collecting TSP. Given a complete metric graph, two prescribed terminal vertices $s,t$, and nonnegative penalties on vertices, the prize-collecting stroll asks for an $s$-$t$ tour minimizing the length of the tour plus the total penalty of vertices that are not visited by the $s,t$ tour. We study a common generalization of the prize-collecting stroll and several related prize-collecting routing problems, which we call the prize-collecting-$\\Phi$-TSP. In this model, $\\Phi$ specifies a set of prescribed vertices alongside their parity a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.18157","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/2606.18157/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":"2606.18157","created_at":"2026-06-19T16:10:49.749924+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.18157v1","created_at":"2026-06-19T16:10:49.749924+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.18157","created_at":"2026-06-19T16:10:49.749924+00:00"},{"alias_kind":"pith_short_12","alias_value":"5EJQTIV7GXBS","created_at":"2026-06-19T16:10:49.749924+00:00"},{"alias_kind":"pith_short_16","alias_value":"5EJQTIV7GXBSW3OZ","created_at":"2026-06-19T16:10:49.749924+00:00"},{"alias_kind":"pith_short_8","alias_value":"5EJQTIV7","created_at":"2026-06-19T16:10:49.749924+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/5EJQTIV7GXBSW3OZXKWZE3TS6N","json":"https://pith.science/pith/5EJQTIV7GXBSW3OZXKWZE3TS6N.json","graph_json":"https://pith.science/api/pith-number/5EJQTIV7GXBSW3OZXKWZE3TS6N/graph.json","events_json":"https://pith.science/api/pith-number/5EJQTIV7GXBSW3OZXKWZE3TS6N/events.json","paper":"https://pith.science/paper/5EJQTIV7"},"agent_actions":{"view_html":"https://pith.science/pith/5EJQTIV7GXBSW3OZXKWZE3TS6N","download_json":"https://pith.science/pith/5EJQTIV7GXBSW3OZXKWZE3TS6N.json","view_paper":"https://pith.science/paper/5EJQTIV7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.18157&json=true","fetch_graph":"https://pith.science/api/pith-number/5EJQTIV7GXBSW3OZXKWZE3TS6N/graph.json","fetch_events":"https://pith.science/api/pith-number/5EJQTIV7GXBSW3OZXKWZE3TS6N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5EJQTIV7GXBSW3OZXKWZE3TS6N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5EJQTIV7GXBSW3OZXKWZE3TS6N/action/storage_attestation","attest_author":"https://pith.science/pith/5EJQTIV7GXBSW3OZXKWZE3TS6N/action/author_attestation","sign_citation":"https://pith.science/pith/5EJQTIV7GXBSW3OZXKWZE3TS6N/action/citation_signature","submit_replication":"https://pith.science/pith/5EJQTIV7GXBSW3OZXKWZE3TS6N/action/replication_record"}},"created_at":"2026-06-19T16:10:49.749924+00:00","updated_at":"2026-06-19T16:10:49.749924+00:00"}