{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:AZERBR7WG7HRPDSXKST5P3OERD","short_pith_number":"pith:AZERBR7W","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"},"canonical_sha256":"064910c7f637cf178e5754a7d7edc488fb3abd934643641e2136c2d476865453","source":{"kind":"arxiv","id":"1308.0482","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.0482","created_at":"2026-05-18T03:06:32Z"},{"alias_kind":"arxiv_version","alias_value":"1308.0482v2","created_at":"2026-05-18T03:06:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0482","created_at":"2026-05-18T03:06:32Z"},{"alias_kind":"pith_short_12","alias_value":"AZERBR7WG7HR","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AZERBR7WG7HRPDSX","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AZERBR7W","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:AZERBR7WG7HRPDSXKST5P3OERD","target":"record","payload":{"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"},"canonical_sha256":"064910c7f637cf178e5754a7d7edc488fb3abd934643641e2136c2d476865453","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"},"source_kind":"arxiv","source_id":"1308.0482","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:06:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+eZXzGLrcWLQYG8QH9uyv/r2pemHZroJpOoiIS7tFhMoKa/h5Rh99NNLdW/cOfOeDyGiCks/LgOLjQ7JsHXOAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:08:56.790405Z"},"content_sha256":"cf17c0bcd099779caa039022b002f536168ee6ef62a8219b724fd1ca21bbbe0c","schema_version":"1.0","event_id":"sha256:cf17c0bcd099779caa039022b002f536168ee6ef62a8219b724fd1ca21bbbe0c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:AZERBR7WG7HRPDSXKST5P3OERD","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:06:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e7dAnCz/QZ3MHijvCrClvvmpjPUKBwyfIELU7u3gAjK41L4xr71mR4nGUnA2XN7f6+iraGkmu29eYCrenO03Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:08:56.791092Z"},"content_sha256":"4b09fca13237d683b22b1fc94d61cfc808575911d64288aaf47aaf27d041985d","schema_version":"1.0","event_id":"sha256:4b09fca13237d683b22b1fc94d61cfc808575911d64288aaf47aaf27d041985d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AZERBR7WG7HRPDSXKST5P3OERD/bundle.json","state_url":"https://pith.science/pith/AZERBR7WG7HRPDSXKST5P3OERD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AZERBR7WG7HRPDSXKST5P3OERD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T20:08:56Z","links":{"resolver":"https://pith.science/pith/AZERBR7WG7HRPDSXKST5P3OERD","bundle":"https://pith.science/pith/AZERBR7WG7HRPDSXKST5P3OERD/bundle.json","state":"https://pith.science/pith/AZERBR7WG7HRPDSXKST5P3OERD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AZERBR7WG7HRPDSXKST5P3OERD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:AZERBR7WG7HRPDSXKST5P3OERD","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"15ce6a7d028905732d91f2fd94fa586ff44f2dd72a4ebdf2687b7df9ebaeca91","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-02T12:43:48Z","title_canon_sha256":"3c56661822eb6d0d6fea55f488fff53921af0c31eaadb13012d451405386823b"},"schema_version":"1.0","source":{"id":"1308.0482","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.0482","created_at":"2026-05-18T03:06:32Z"},{"alias_kind":"arxiv_version","alias_value":"1308.0482v2","created_at":"2026-05-18T03:06:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0482","created_at":"2026-05-18T03:06:32Z"},{"alias_kind":"pith_short_12","alias_value":"AZERBR7WG7HR","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AZERBR7WG7HRPDSX","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AZERBR7W","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:4b09fca13237d683b22b1fc94d61cfc808575911d64288aaf47aaf27d041985d","target":"graph","created_at":"2026-05-18T03:06:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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: ","authors_text":"Anders Yeo, Gabriele Muciaccia, Gregory Gutin","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-02T12:43:48Z","title":"Parameterized Complexity of k-Chinese Postman Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.0482","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cf17c0bcd099779caa039022b002f536168ee6ef62a8219b724fd1ca21bbbe0c","target":"record","created_at":"2026-05-18T03:06:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"15ce6a7d028905732d91f2fd94fa586ff44f2dd72a4ebdf2687b7df9ebaeca91","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-02T12:43:48Z","title_canon_sha256":"3c56661822eb6d0d6fea55f488fff53921af0c31eaadb13012d451405386823b"},"schema_version":"1.0","source":{"id":"1308.0482","kind":"arxiv","version":2}},"canonical_sha256":"064910c7f637cf178e5754a7d7edc488fb3abd934643641e2136c2d476865453","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"064910c7f637cf178e5754a7d7edc488fb3abd934643641e2136c2d476865453","first_computed_at":"2026-05-18T03:06:32.411203Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:32.411203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9F9lfbDwaUG86HrN89cnfdEqKb6GsAja3+JD3zl2u+axoJJ7Q9U/cpKvElqGWQj9Jj1QIuYjf9+eOa1H/2+pAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:32.411908Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.0482","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf17c0bcd099779caa039022b002f536168ee6ef62a8219b724fd1ca21bbbe0c","sha256:4b09fca13237d683b22b1fc94d61cfc808575911d64288aaf47aaf27d041985d"],"state_sha256":"62fe19f77271e3daa95c7e22431a4a5f80498cdbb95213827e737f0ae1cecc8e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"goht5TIc7FAhq3TAqlE6dW1AOQqJBuBSOSkZf+b9MEZ1tss/3dZFheir8fW0pW2j75J3qGUS+0xl8DRKYbioBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T20:08:56.795736Z","bundle_sha256":"fa39f89a670cbee283ca68a5c7e50a48090b23f096228396561b143afba6a925"}}