{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:AZERBR7WG7HRPDSXKST5P3OERD","short_pith_number":"pith:AZERBR7W","schema_version":"1.0","canonical_sha256":"064910c7f637cf178e5754a7d7edc488fb3abd934643641e2136c2d476865453","source":{"kind":"arxiv","id":"1308.0482","version":2},"attestation_state":"computed","paper":{"title":"Parameterized Complexity of k-Chinese Postman Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Anders Yeo, Gabriele Muciaccia, Gregory Gutin","submitted_at":"2013-08-02T12:43:48Z","abstract_excerpt":"We consider the following problem called the $k$-Chinese Postman Problem ($k$-CPP): given a connected edge-weighted graph $G$ and integers $p$ and $k$, decide whether there are at least $k$ closed walks such that every edge of $G$ is contained in at least one of them and the total weight of the edges in the walks is at most $p$? The problem $k$-CPP is NP-complete, and van Bevern et al. (to appear) and Sorge (2013) asked whether the $k$-CPP is fixed-parameter tractable when parameterized by $k$. We prove that the $k$-CPP is indeed fixed-parameter tractable. In fact, we prove a stronger result: "},"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":"1308.0482","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-02T12:43:48Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"3c56661822eb6d0d6fea55f488fff53921af0c31eaadb13012d451405386823b","abstract_canon_sha256":"15ce6a7d028905732d91f2fd94fa586ff44f2dd72a4ebdf2687b7df9ebaeca91"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:32.411908Z","signature_b64":"9F9lfbDwaUG86HrN89cnfdEqKb6GsAja3+JD3zl2u+axoJJ7Q9U/cpKvElqGWQj9Jj1QIuYjf9+eOa1H/2+pAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"064910c7f637cf178e5754a7d7edc488fb3abd934643641e2136c2d476865453","last_reissued_at":"2026-05-18T03:06:32.411203Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:32.411203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized Complexity of k-Chinese Postman Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Anders Yeo, Gabriele Muciaccia, Gregory Gutin","submitted_at":"2013-08-02T12:43:48Z","abstract_excerpt":"We consider the following problem called the $k$-Chinese Postman Problem ($k$-CPP): given a connected edge-weighted graph $G$ and integers $p$ and $k$, decide whether there are at least $k$ closed walks such that every edge of $G$ is contained in at least one of them and the total weight of the edges in the walks is at most $p$? The problem $k$-CPP is NP-complete, and van Bevern et al. (to appear) and Sorge (2013) asked whether the $k$-CPP is fixed-parameter tractable when parameterized by $k$. We prove that the $k$-CPP is indeed fixed-parameter tractable. In fact, we prove a stronger result: "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.0482","kind":"arxiv","version":2},"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":"1308.0482","created_at":"2026-05-18T03:06:32.411332+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.0482v2","created_at":"2026-05-18T03:06:32.411332+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0482","created_at":"2026-05-18T03:06:32.411332+00:00"},{"alias_kind":"pith_short_12","alias_value":"AZERBR7WG7HR","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"AZERBR7WG7HRPDSX","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"AZERBR7W","created_at":"2026-05-18T12:27:38.830355+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/AZERBR7WG7HRPDSXKST5P3OERD","json":"https://pith.science/pith/AZERBR7WG7HRPDSXKST5P3OERD.json","graph_json":"https://pith.science/api/pith-number/AZERBR7WG7HRPDSXKST5P3OERD/graph.json","events_json":"https://pith.science/api/pith-number/AZERBR7WG7HRPDSXKST5P3OERD/events.json","paper":"https://pith.science/paper/AZERBR7W"},"agent_actions":{"view_html":"https://pith.science/pith/AZERBR7WG7HRPDSXKST5P3OERD","download_json":"https://pith.science/pith/AZERBR7WG7HRPDSXKST5P3OERD.json","view_paper":"https://pith.science/paper/AZERBR7W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.0482&json=true","fetch_graph":"https://pith.science/api/pith-number/AZERBR7WG7HRPDSXKST5P3OERD/graph.json","fetch_events":"https://pith.science/api/pith-number/AZERBR7WG7HRPDSXKST5P3OERD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AZERBR7WG7HRPDSXKST5P3OERD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AZERBR7WG7HRPDSXKST5P3OERD/action/storage_attestation","attest_author":"https://pith.science/pith/AZERBR7WG7HRPDSXKST5P3OERD/action/author_attestation","sign_citation":"https://pith.science/pith/AZERBR7WG7HRPDSXKST5P3OERD/action/citation_signature","submit_replication":"https://pith.science/pith/AZERBR7WG7HRPDSXKST5P3OERD/action/replication_record"}},"created_at":"2026-05-18T03:06:32.411332+00:00","updated_at":"2026-05-18T03:06:32.411332+00:00"}