{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:TDLRS34UTKZG544XH7WCXCS35T","short_pith_number":"pith:TDLRS34U","schema_version":"1.0","canonical_sha256":"98d7196f949ab26ef3973fec2b8a5bece1db36f138c6fc3c601328caabc4ad54","source":{"kind":"arxiv","id":"2606.31907","version":1},"attestation_state":"computed","paper":{"title":"Improved Algorithms for Bounded-Degree (Subset) Traveling Salesman Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hyung-Chan An, Jaehyeok Kwak, Jongseo Lee","submitted_at":"2026-06-30T16:10:19Z","abstract_excerpt":"We present improved algorithms for several bounded-degree traveling salesman problems. In the bounded-degree traveling salesman path problem (BDTSPP), given a weighted graph G=(V,E), two endpoints s and t, and degree bounds b_v for all v, the goal is to find a minimum-cost subgraph of G that admits an Eulerian s-t path and in which each vertex v has degree at most b_v. Since deciding feasibility is already NP-hard for this problem, previous work gave a bicriteria approximation algorithm. However, that algorithm provides only a multiplicative guarantee on the degree violation, and it was left o"},"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.31907","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-30T16:10:19Z","cross_cats_sorted":[],"title_canon_sha256":"2830c1d6e6680e168e657d377d28b7ffac7750aa4d9d59d25448a038018c1647","abstract_canon_sha256":"41cb8aa07d82b3eee0d65fdc3e17f5354530147315ecff5129c0057f11948d0f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-01T01:18:19.136545Z","signature_b64":"aIRdgRBJ8UCnKyOMWuOKjw1J1jqVEXnq/qR1dF2mL1dV4xrYLnef/I4rOwNw25MRoVJ2Qy2n3V5WpN5OBoCfDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98d7196f949ab26ef3973fec2b8a5bece1db36f138c6fc3c601328caabc4ad54","last_reissued_at":"2026-07-01T01:18:19.136035Z","signature_status":"signed_v1","first_computed_at":"2026-07-01T01:18:19.136035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Algorithms for Bounded-Degree (Subset) Traveling Salesman Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hyung-Chan An, Jaehyeok Kwak, Jongseo Lee","submitted_at":"2026-06-30T16:10:19Z","abstract_excerpt":"We present improved algorithms for several bounded-degree traveling salesman problems. In the bounded-degree traveling salesman path problem (BDTSPP), given a weighted graph G=(V,E), two endpoints s and t, and degree bounds b_v for all v, the goal is to find a minimum-cost subgraph of G that admits an Eulerian s-t path and in which each vertex v has degree at most b_v. Since deciding feasibility is already NP-hard for this problem, previous work gave a bicriteria approximation algorithm. However, that algorithm provides only a multiplicative guarantee on the degree violation, and it was left o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.31907","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.31907/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.31907","created_at":"2026-07-01T01:18:19.136094+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.31907v1","created_at":"2026-07-01T01:18:19.136094+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.31907","created_at":"2026-07-01T01:18:19.136094+00:00"},{"alias_kind":"pith_short_12","alias_value":"TDLRS34UTKZG","created_at":"2026-07-01T01:18:19.136094+00:00"},{"alias_kind":"pith_short_16","alias_value":"TDLRS34UTKZG544X","created_at":"2026-07-01T01:18:19.136094+00:00"},{"alias_kind":"pith_short_8","alias_value":"TDLRS34U","created_at":"2026-07-01T01:18:19.136094+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/TDLRS34UTKZG544XH7WCXCS35T","json":"https://pith.science/pith/TDLRS34UTKZG544XH7WCXCS35T.json","graph_json":"https://pith.science/api/pith-number/TDLRS34UTKZG544XH7WCXCS35T/graph.json","events_json":"https://pith.science/api/pith-number/TDLRS34UTKZG544XH7WCXCS35T/events.json","paper":"https://pith.science/paper/TDLRS34U"},"agent_actions":{"view_html":"https://pith.science/pith/TDLRS34UTKZG544XH7WCXCS35T","download_json":"https://pith.science/pith/TDLRS34UTKZG544XH7WCXCS35T.json","view_paper":"https://pith.science/paper/TDLRS34U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.31907&json=true","fetch_graph":"https://pith.science/api/pith-number/TDLRS34UTKZG544XH7WCXCS35T/graph.json","fetch_events":"https://pith.science/api/pith-number/TDLRS34UTKZG544XH7WCXCS35T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TDLRS34UTKZG544XH7WCXCS35T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TDLRS34UTKZG544XH7WCXCS35T/action/storage_attestation","attest_author":"https://pith.science/pith/TDLRS34UTKZG544XH7WCXCS35T/action/author_attestation","sign_citation":"https://pith.science/pith/TDLRS34UTKZG544XH7WCXCS35T/action/citation_signature","submit_replication":"https://pith.science/pith/TDLRS34UTKZG544XH7WCXCS35T/action/replication_record"}},"created_at":"2026-07-01T01:18:19.136094+00:00","updated_at":"2026-07-01T01:18:19.136094+00:00"}