{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FPZBK42PHTLJKNDSLXGGYIXSCA","short_pith_number":"pith:FPZBK42P","schema_version":"1.0","canonical_sha256":"2bf215734f3cd69534725dcc6c22f210386b391f5c1908ad9fad94cebbf3d23c","source":{"kind":"arxiv","id":"1402.2137","version":1},"attestation_state":"computed","paper":{"title":"Parameterized Directed $k$-Chinese Postman Problem and $k$ Arc-Disjoint Cycles Problem on Euler Digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bin Sheng, Gregory Gutin, Magnus Wahlstrom, Mark Jones","submitted_at":"2014-02-10T13:25:18Z","abstract_excerpt":"In the Directed $k$-Chinese Postman Problem ($k$-DCPP), we are given a connected weighted digraph $G$ and asked to find $k$ non-empty closed directed walks covering all arcs of $G$ such that the total weight of the walks is minimum. Gutin, Muciaccia and Yeo (Theor. Comput. Sci. 513 (2013) 124--128) asked for the parameterized complexity of $k$-DCPP when $k$ is the parameter. We prove that the $k$-DCPP is fixed-parameter tractable.\n  We also consider a related problem of finding $k$ arc-disjoint directed cycles in an Euler digraph, parameterized by $k$. Slivkins (ESA 2003) showed that this prob"},"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":"1402.2137","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-10T13:25:18Z","cross_cats_sorted":[],"title_canon_sha256":"90ebb9d982e4c498284f0e7ae4eff6be0c3b867a50ad641e8299a8652d9143f6","abstract_canon_sha256":"5dac9fd02217cc4a981245aa0bd4990f8a60c93c7aa2580840e6049ef1aae79c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:32.233527Z","signature_b64":"BbX04l8ZL/ji1Lsbd6fHdS55neYJgzld1u+tLXbMW91g1fJ5E14YNqbZ/iArep3C5WLd2fWQvMXS7dZFKUV+Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2bf215734f3cd69534725dcc6c22f210386b391f5c1908ad9fad94cebbf3d23c","last_reissued_at":"2026-05-18T02:59:32.232779Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:32.232779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized Directed $k$-Chinese Postman Problem and $k$ Arc-Disjoint Cycles Problem on Euler Digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bin Sheng, Gregory Gutin, Magnus Wahlstrom, Mark Jones","submitted_at":"2014-02-10T13:25:18Z","abstract_excerpt":"In the Directed $k$-Chinese Postman Problem ($k$-DCPP), we are given a connected weighted digraph $G$ and asked to find $k$ non-empty closed directed walks covering all arcs of $G$ such that the total weight of the walks is minimum. Gutin, Muciaccia and Yeo (Theor. Comput. Sci. 513 (2013) 124--128) asked for the parameterized complexity of $k$-DCPP when $k$ is the parameter. We prove that the $k$-DCPP is fixed-parameter tractable.\n  We also consider a related problem of finding $k$ arc-disjoint directed cycles in an Euler digraph, parameterized by $k$. Slivkins (ESA 2003) showed that this prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2137","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":""},"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":"1402.2137","created_at":"2026-05-18T02:59:32.232905+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.2137v1","created_at":"2026-05-18T02:59:32.232905+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2137","created_at":"2026-05-18T02:59:32.232905+00:00"},{"alias_kind":"pith_short_12","alias_value":"FPZBK42PHTLJ","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FPZBK42PHTLJKNDS","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FPZBK42P","created_at":"2026-05-18T12:28:28.263976+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/FPZBK42PHTLJKNDSLXGGYIXSCA","json":"https://pith.science/pith/FPZBK42PHTLJKNDSLXGGYIXSCA.json","graph_json":"https://pith.science/api/pith-number/FPZBK42PHTLJKNDSLXGGYIXSCA/graph.json","events_json":"https://pith.science/api/pith-number/FPZBK42PHTLJKNDSLXGGYIXSCA/events.json","paper":"https://pith.science/paper/FPZBK42P"},"agent_actions":{"view_html":"https://pith.science/pith/FPZBK42PHTLJKNDSLXGGYIXSCA","download_json":"https://pith.science/pith/FPZBK42PHTLJKNDSLXGGYIXSCA.json","view_paper":"https://pith.science/paper/FPZBK42P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.2137&json=true","fetch_graph":"https://pith.science/api/pith-number/FPZBK42PHTLJKNDSLXGGYIXSCA/graph.json","fetch_events":"https://pith.science/api/pith-number/FPZBK42PHTLJKNDSLXGGYIXSCA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FPZBK42PHTLJKNDSLXGGYIXSCA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FPZBK42PHTLJKNDSLXGGYIXSCA/action/storage_attestation","attest_author":"https://pith.science/pith/FPZBK42PHTLJKNDSLXGGYIXSCA/action/author_attestation","sign_citation":"https://pith.science/pith/FPZBK42PHTLJKNDSLXGGYIXSCA/action/citation_signature","submit_replication":"https://pith.science/pith/FPZBK42PHTLJKNDSLXGGYIXSCA/action/replication_record"}},"created_at":"2026-05-18T02:59:32.232905+00:00","updated_at":"2026-05-18T02:59:32.232905+00:00"}