{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:3XUURO3QY4JEAK64OQALU6SJEV","short_pith_number":"pith:3XUURO3Q","canonical_record":{"source":{"id":"1403.1512","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-06T17:52:28Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"6064c72baa34c97b1c0f17e4abc2fd658be060c573c13d80777e6b7b147b83b5","abstract_canon_sha256":"6ea1c77a17b1db12324ee8ac2d571ca2105b5db7cd467efd1cf09ff49d78e243"},"schema_version":"1.0"},"canonical_sha256":"dde948bb70c712402bdc7400ba7a492548c408d6ab8c3dddddbec5c460e8fb71","source":{"kind":"arxiv","id":"1403.1512","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.1512","created_at":"2026-05-18T01:04:50Z"},{"alias_kind":"arxiv_version","alias_value":"1403.1512v4","created_at":"2026-05-18T01:04:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.1512","created_at":"2026-05-18T01:04:50Z"},{"alias_kind":"pith_short_12","alias_value":"3XUURO3QY4JE","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3XUURO3QY4JEAK64","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3XUURO3Q","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:3XUURO3QY4JEAK64OQALU6SJEV","target":"record","payload":{"canonical_record":{"source":{"id":"1403.1512","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-06T17:52:28Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"6064c72baa34c97b1c0f17e4abc2fd658be060c573c13d80777e6b7b147b83b5","abstract_canon_sha256":"6ea1c77a17b1db12324ee8ac2d571ca2105b5db7cd467efd1cf09ff49d78e243"},"schema_version":"1.0"},"canonical_sha256":"dde948bb70c712402bdc7400ba7a492548c408d6ab8c3dddddbec5c460e8fb71","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:50.788159Z","signature_b64":"685mwI93vUjJm+o3UNca56OHS1kDsNlnKAia4SOy5CzzlTHBLjZXZRB326jr8XDmLMlpEy3lobJKxlsVxciKBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dde948bb70c712402bdc7400ba7a492548c408d6ab8c3dddddbec5c460e8fb71","last_reissued_at":"2026-05-18T01:04:50.787733Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:50.787733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.1512","source_version":4,"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-18T01:04:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RBlLa4Wj4EMV5VkatPk3jV7Uva1mOIyiPW/jcwMKiwtY+kzt0UZdHYVrxr9jXEBYSjWpe5TxSSmCjq2Scv3vCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:12:24.232811Z"},"content_sha256":"eddbb5e63c6afcb35c4cb645fc3c6d1b9d3a07e49e8558039baf18f2a5b4e7ec","schema_version":"1.0","event_id":"sha256:eddbb5e63c6afcb35c4cb645fc3c6d1b9d3a07e49e8558039baf18f2a5b4e7ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:3XUURO3QY4JEAK64OQALU6SJEV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Complexity of the $k$-Arc Chinese Postman Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Bin Sheng, Gregory Gutin, Mark Jones","submitted_at":"2014-03-06T17:52:28Z","abstract_excerpt":"In the Mixed Chinese Postman Problem (MCPP), given an edge-weighted mixed graph $G$ ($G$ may have both edges and arcs), our aim is to find a minimum weight closed walk traversing each edge and arc at least once. The MCPP parameterized by the number of edges was known to be fixed-parameter tractable using a simple argument. Solving an open question of van Bevern et al., we prove that the MCPP parameterized by the number of arcs is also fixed-parameter tractable. Our proof is more involved and, in particular, uses a well-known result of Marx, O'Sullivan and Razgon (2013) on the treewidth of tors"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.1512","kind":"arxiv","version":4},"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-18T01:04:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7jHgTlUNQou8C3TCiKVg57fLv/3BMgLNmjz8+Yy4LrIQq+zKzaUcUdAcIDW/35MmEx6a5MwHpXT3dExFfbfCAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:12:24.233514Z"},"content_sha256":"f0e89dcb0d937956a890f82ca4f1088037fe496937c5c44be8dd69a2fcbd812f","schema_version":"1.0","event_id":"sha256:f0e89dcb0d937956a890f82ca4f1088037fe496937c5c44be8dd69a2fcbd812f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3XUURO3QY4JEAK64OQALU6SJEV/bundle.json","state_url":"https://pith.science/pith/3XUURO3QY4JEAK64OQALU6SJEV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3XUURO3QY4JEAK64OQALU6SJEV/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-31T16:12:24Z","links":{"resolver":"https://pith.science/pith/3XUURO3QY4JEAK64OQALU6SJEV","bundle":"https://pith.science/pith/3XUURO3QY4JEAK64OQALU6SJEV/bundle.json","state":"https://pith.science/pith/3XUURO3QY4JEAK64OQALU6SJEV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3XUURO3QY4JEAK64OQALU6SJEV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:3XUURO3QY4JEAK64OQALU6SJEV","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":"6ea1c77a17b1db12324ee8ac2d571ca2105b5db7cd467efd1cf09ff49d78e243","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-06T17:52:28Z","title_canon_sha256":"6064c72baa34c97b1c0f17e4abc2fd658be060c573c13d80777e6b7b147b83b5"},"schema_version":"1.0","source":{"id":"1403.1512","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.1512","created_at":"2026-05-18T01:04:50Z"},{"alias_kind":"arxiv_version","alias_value":"1403.1512v4","created_at":"2026-05-18T01:04:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.1512","created_at":"2026-05-18T01:04:50Z"},{"alias_kind":"pith_short_12","alias_value":"3XUURO3QY4JE","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3XUURO3QY4JEAK64","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3XUURO3Q","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:f0e89dcb0d937956a890f82ca4f1088037fe496937c5c44be8dd69a2fcbd812f","target":"graph","created_at":"2026-05-18T01:04:50Z","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 Mixed Chinese Postman Problem (MCPP), given an edge-weighted mixed graph $G$ ($G$ may have both edges and arcs), our aim is to find a minimum weight closed walk traversing each edge and arc at least once. The MCPP parameterized by the number of edges was known to be fixed-parameter tractable using a simple argument. Solving an open question of van Bevern et al., we prove that the MCPP parameterized by the number of arcs is also fixed-parameter tractable. Our proof is more involved and, in particular, uses a well-known result of Marx, O'Sullivan and Razgon (2013) on the treewidth of tors","authors_text":"Bin Sheng, Gregory Gutin, Mark Jones","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-06T17:52:28Z","title":"Parameterized Complexity of the $k$-Arc Chinese Postman Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.1512","kind":"arxiv","version":4},"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:eddbb5e63c6afcb35c4cb645fc3c6d1b9d3a07e49e8558039baf18f2a5b4e7ec","target":"record","created_at":"2026-05-18T01:04:50Z","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":"6ea1c77a17b1db12324ee8ac2d571ca2105b5db7cd467efd1cf09ff49d78e243","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-06T17:52:28Z","title_canon_sha256":"6064c72baa34c97b1c0f17e4abc2fd658be060c573c13d80777e6b7b147b83b5"},"schema_version":"1.0","source":{"id":"1403.1512","kind":"arxiv","version":4}},"canonical_sha256":"dde948bb70c712402bdc7400ba7a492548c408d6ab8c3dddddbec5c460e8fb71","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dde948bb70c712402bdc7400ba7a492548c408d6ab8c3dddddbec5c460e8fb71","first_computed_at":"2026-05-18T01:04:50.787733Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:50.787733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"685mwI93vUjJm+o3UNca56OHS1kDsNlnKAia4SOy5CzzlTHBLjZXZRB326jr8XDmLMlpEy3lobJKxlsVxciKBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:50.788159Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.1512","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eddbb5e63c6afcb35c4cb645fc3c6d1b9d3a07e49e8558039baf18f2a5b4e7ec","sha256:f0e89dcb0d937956a890f82ca4f1088037fe496937c5c44be8dd69a2fcbd812f"],"state_sha256":"9a63374dc805484af6897342f78311df26cba8bfce83f428050c39c84589d8b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YazrtgfTnodTiE857gLTFhOtyanAxT3ySgBz9N12Cf3bB5iuhfvlq5VrN8tOUreMw6a5La4sdukbzUKGImDtBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T16:12:24.236989Z","bundle_sha256":"dd1a2999db78831429ee96306753a62a0e9b513c70642835437871bb2ff7a9dd"}}