{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Z44MCSZM7RHEBZTQ653GOOCYVN","short_pith_number":"pith:Z44MCSZM","schema_version":"1.0","canonical_sha256":"cf38c14b2cfc4e40e670f776673858ab78e4d1f8e2208e927e71b67186ecf3c1","source":{"kind":"arxiv","id":"1707.06503","version":1},"attestation_state":"computed","paper":{"title":"The Euler and Chinese Postman Problems on 2-Arc-Colored Digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Bin Sheng, Gregory Gutin, Ruijuan Li","submitted_at":"2017-07-20T13:45:36Z","abstract_excerpt":"The famous Chinese Postman Problem (CPP) is polynomial time solvable on both undirected and directed graphs. Gutin et al. [Discrete Applied Math 217 (2016)] generalized these results by proving that CPP on $c$-edge-colored graphs is polynomial time solvable for every $c\\geq 2$. In CPP on weighted edge-colored graphs $G$, we wish to find a minimum weight properly colored closed walk containing all edges of $G$ (a walk is properly colored if every two consecutive edges are of different color, including the last and first edges in a closed walk). In this paper, we consider CPP on arc-colored digr"},"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":"1707.06503","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-20T13:45:36Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"980ca66b029d88d5d55b8092b6a1deb5e657b98d6a0aca9fb0720aad36788f49","abstract_canon_sha256":"f0e98a325d7cd4d772b8eb3bf1bb4adc99878ea95a9a16da689e06b6d945df09"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:53.665335Z","signature_b64":"5ZQfmoiOHuYOWU8sXOt4mNOZDfAK8+tHiHg1RK8W1C8Jn9K2qjHUD/H+Ht2ql242iy8nunz4HaWcy7PpDnXWCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf38c14b2cfc4e40e670f776673858ab78e4d1f8e2208e927e71b67186ecf3c1","last_reissued_at":"2026-05-18T00:39:53.664702Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:53.664702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Euler and Chinese Postman Problems on 2-Arc-Colored Digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Bin Sheng, Gregory Gutin, Ruijuan Li","submitted_at":"2017-07-20T13:45:36Z","abstract_excerpt":"The famous Chinese Postman Problem (CPP) is polynomial time solvable on both undirected and directed graphs. Gutin et al. [Discrete Applied Math 217 (2016)] generalized these results by proving that CPP on $c$-edge-colored graphs is polynomial time solvable for every $c\\geq 2$. In CPP on weighted edge-colored graphs $G$, we wish to find a minimum weight properly colored closed walk containing all edges of $G$ (a walk is properly colored if every two consecutive edges are of different color, including the last and first edges in a closed walk). In this paper, we consider CPP on arc-colored digr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06503","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":"1707.06503","created_at":"2026-05-18T00:39:53.664776+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.06503v1","created_at":"2026-05-18T00:39:53.664776+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06503","created_at":"2026-05-18T00:39:53.664776+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z44MCSZM7RHE","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z44MCSZM7RHEBZTQ","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z44MCSZM","created_at":"2026-05-18T12:31:59.375834+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/Z44MCSZM7RHEBZTQ653GOOCYVN","json":"https://pith.science/pith/Z44MCSZM7RHEBZTQ653GOOCYVN.json","graph_json":"https://pith.science/api/pith-number/Z44MCSZM7RHEBZTQ653GOOCYVN/graph.json","events_json":"https://pith.science/api/pith-number/Z44MCSZM7RHEBZTQ653GOOCYVN/events.json","paper":"https://pith.science/paper/Z44MCSZM"},"agent_actions":{"view_html":"https://pith.science/pith/Z44MCSZM7RHEBZTQ653GOOCYVN","download_json":"https://pith.science/pith/Z44MCSZM7RHEBZTQ653GOOCYVN.json","view_paper":"https://pith.science/paper/Z44MCSZM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.06503&json=true","fetch_graph":"https://pith.science/api/pith-number/Z44MCSZM7RHEBZTQ653GOOCYVN/graph.json","fetch_events":"https://pith.science/api/pith-number/Z44MCSZM7RHEBZTQ653GOOCYVN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z44MCSZM7RHEBZTQ653GOOCYVN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z44MCSZM7RHEBZTQ653GOOCYVN/action/storage_attestation","attest_author":"https://pith.science/pith/Z44MCSZM7RHEBZTQ653GOOCYVN/action/author_attestation","sign_citation":"https://pith.science/pith/Z44MCSZM7RHEBZTQ653GOOCYVN/action/citation_signature","submit_replication":"https://pith.science/pith/Z44MCSZM7RHEBZTQ653GOOCYVN/action/replication_record"}},"created_at":"2026-05-18T00:39:53.664776+00:00","updated_at":"2026-05-18T00:39:53.664776+00:00"}