{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:FPZBK42PHTLJKNDSLXGGYIXSCA","short_pith_number":"pith:FPZBK42P","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"},"canonical_sha256":"2bf215734f3cd69534725dcc6c22f210386b391f5c1908ad9fad94cebbf3d23c","source":{"kind":"arxiv","id":"1402.2137","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2137","created_at":"2026-05-18T02:59:32Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2137v1","created_at":"2026-05-18T02:59:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2137","created_at":"2026-05-18T02:59:32Z"},{"alias_kind":"pith_short_12","alias_value":"FPZBK42PHTLJ","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FPZBK42PHTLJKNDS","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FPZBK42P","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:FPZBK42PHTLJKNDSLXGGYIXSCA","target":"record","payload":{"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"},"canonical_sha256":"2bf215734f3cd69534725dcc6c22f210386b391f5c1908ad9fad94cebbf3d23c","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"},"source_kind":"arxiv","source_id":"1402.2137","source_version":1,"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-18T02:59:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mzrM5IusWZbCTAZX/5tTPKxXX+PkTfzXxmhidUR74g0sO67tbZ8OqGa6Y1TTu+rFsQWKVzQth6K29pasLRE8Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:38:05.089289Z"},"content_sha256":"e0886b980e208289a8b5339a0106127dd91aa9f80597a4733af01df19a6c7dc7","schema_version":"1.0","event_id":"sha256:e0886b980e208289a8b5339a0106127dd91aa9f80597a4733af01df19a6c7dc7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:FPZBK42PHTLJKNDSLXGGYIXSCA","target":"graph","payload":{"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"},"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-18T02:59:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q5cWqXw3V5ucY3qn5jnh96uZQ1JrMEDRR1MDL/JwEYdhviIBqOgBhK4TGyb0YlRXc1hwFvnJMh6iPuOyIeoRBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:38:05.089787Z"},"content_sha256":"4dc91526e13d41306b656ac020ea7ea820ee4c9ca4aa92328b9971c2646f3d7e","schema_version":"1.0","event_id":"sha256:4dc91526e13d41306b656ac020ea7ea820ee4c9ca4aa92328b9971c2646f3d7e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FPZBK42PHTLJKNDSLXGGYIXSCA/bundle.json","state_url":"https://pith.science/pith/FPZBK42PHTLJKNDSLXGGYIXSCA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FPZBK42PHTLJKNDSLXGGYIXSCA/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-26T15:38:05Z","links":{"resolver":"https://pith.science/pith/FPZBK42PHTLJKNDSLXGGYIXSCA","bundle":"https://pith.science/pith/FPZBK42PHTLJKNDSLXGGYIXSCA/bundle.json","state":"https://pith.science/pith/FPZBK42PHTLJKNDSLXGGYIXSCA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FPZBK42PHTLJKNDSLXGGYIXSCA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FPZBK42PHTLJKNDSLXGGYIXSCA","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":"5dac9fd02217cc4a981245aa0bd4990f8a60c93c7aa2580840e6049ef1aae79c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-10T13:25:18Z","title_canon_sha256":"90ebb9d982e4c498284f0e7ae4eff6be0c3b867a50ad641e8299a8652d9143f6"},"schema_version":"1.0","source":{"id":"1402.2137","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2137","created_at":"2026-05-18T02:59:32Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2137v1","created_at":"2026-05-18T02:59:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2137","created_at":"2026-05-18T02:59:32Z"},{"alias_kind":"pith_short_12","alias_value":"FPZBK42PHTLJ","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FPZBK42PHTLJKNDS","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FPZBK42P","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:4dc91526e13d41306b656ac020ea7ea820ee4c9ca4aa92328b9971c2646f3d7e","target":"graph","created_at":"2026-05-18T02:59: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":"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","authors_text":"Bin Sheng, Gregory Gutin, Magnus Wahlstrom, Mark Jones","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-10T13:25:18Z","title":"Parameterized Directed $k$-Chinese Postman Problem and $k$ Arc-Disjoint Cycles Problem on Euler Digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2137","kind":"arxiv","version":1},"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:e0886b980e208289a8b5339a0106127dd91aa9f80597a4733af01df19a6c7dc7","target":"record","created_at":"2026-05-18T02:59: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":"5dac9fd02217cc4a981245aa0bd4990f8a60c93c7aa2580840e6049ef1aae79c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-10T13:25:18Z","title_canon_sha256":"90ebb9d982e4c498284f0e7ae4eff6be0c3b867a50ad641e8299a8652d9143f6"},"schema_version":"1.0","source":{"id":"1402.2137","kind":"arxiv","version":1}},"canonical_sha256":"2bf215734f3cd69534725dcc6c22f210386b391f5c1908ad9fad94cebbf3d23c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2bf215734f3cd69534725dcc6c22f210386b391f5c1908ad9fad94cebbf3d23c","first_computed_at":"2026-05-18T02:59:32.232779Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:32.232779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BbX04l8ZL/ji1Lsbd6fHdS55neYJgzld1u+tLXbMW91g1fJ5E14YNqbZ/iArep3C5WLd2fWQvMXS7dZFKUV+Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:32.233527Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.2137","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0886b980e208289a8b5339a0106127dd91aa9f80597a4733af01df19a6c7dc7","sha256:4dc91526e13d41306b656ac020ea7ea820ee4c9ca4aa92328b9971c2646f3d7e"],"state_sha256":"6049271805906724fe4026ac41fbcde10ad3f3df0e4802a5ccb647b8080aa369"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jZ+/l2NG6dZex93oNRTbFP5amFuw+sqctyR3IhHGjsDRFZHJk7aAVBTKwiJTfXbnJgc/VSCpYO2EhvB5nQZ/AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T15:38:05.092949Z","bundle_sha256":"5917535d4f07fc67c965cecdff54574c67afddf046175e8cfd526fea9f3f9f17"}}