{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5CER4WROBUS3W3KFINK7POTZ3J","short_pith_number":"pith:5CER4WRO","schema_version":"1.0","canonical_sha256":"e8891e5a2e0d25bb6d454355f7ba79da413ebde188a6b4b6d93e928b223c8633","source":{"kind":"arxiv","id":"1601.01824","version":3},"attestation_state":"computed","paper":{"title":"Acyclicity in Edge-Colored Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Anders Yeo, Bin Sheng, Gregory Gutin, Magnus Wahlstrom, Mark Jones","submitted_at":"2016-01-08T10:50:14Z","abstract_excerpt":"A walk $W$ in edge-colored graphs is called properly colored (PC) if every pair of consecutive edges in $W$ is of different color. We introduce and study five types of PC acyclicity in edge-colored graphs such that graphs of PC acyclicity of type $i$ is a proper superset of graphs of acyclicity of type $i+1$, $i=1,2,3,4.$ The first three types are equivalent to the absence of PC cycles, PC trails, and PC walks, respectively. While graphs of types 1, 2 and 3 can be recognized in polynomial time, the problem of recognizing graphs of type 4 is, somewhat surprisingly, NP-hard even for 2-edge-color"},"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":"1601.01824","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-01-08T10:50:14Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"1d260ea3c7dcce8d339d9be4692e56b4e977c411a7fceea213ec3283d3e4dcd2","abstract_canon_sha256":"09bc538512554618e03506930e082521a3d34f84a18b2cb4e95f2ed9513e91ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:50.228514Z","signature_b64":"mFV4XHJhPdUE3HidHK1AoVvNiza5GeLG7ggLS1iEJyJ75xLrXZF/6KsbNfgwF9Hp2U2QFbsqWX2wd077uFtiDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8891e5a2e0d25bb6d454355f7ba79da413ebde188a6b4b6d93e928b223c8633","last_reissued_at":"2026-05-18T01:04:50.227981Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:50.227981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Acyclicity in Edge-Colored Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Anders Yeo, Bin Sheng, Gregory Gutin, Magnus Wahlstrom, Mark Jones","submitted_at":"2016-01-08T10:50:14Z","abstract_excerpt":"A walk $W$ in edge-colored graphs is called properly colored (PC) if every pair of consecutive edges in $W$ is of different color. We introduce and study five types of PC acyclicity in edge-colored graphs such that graphs of PC acyclicity of type $i$ is a proper superset of graphs of acyclicity of type $i+1$, $i=1,2,3,4.$ The first three types are equivalent to the absence of PC cycles, PC trails, and PC walks, respectively. While graphs of types 1, 2 and 3 can be recognized in polynomial time, the problem of recognizing graphs of type 4 is, somewhat surprisingly, NP-hard even for 2-edge-color"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.01824","kind":"arxiv","version":3},"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":"1601.01824","created_at":"2026-05-18T01:04:50.228057+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.01824v3","created_at":"2026-05-18T01:04:50.228057+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01824","created_at":"2026-05-18T01:04:50.228057+00:00"},{"alias_kind":"pith_short_12","alias_value":"5CER4WROBUS3","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5CER4WROBUS3W3KF","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5CER4WRO","created_at":"2026-05-18T12:30:01.593930+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/5CER4WROBUS3W3KFINK7POTZ3J","json":"https://pith.science/pith/5CER4WROBUS3W3KFINK7POTZ3J.json","graph_json":"https://pith.science/api/pith-number/5CER4WROBUS3W3KFINK7POTZ3J/graph.json","events_json":"https://pith.science/api/pith-number/5CER4WROBUS3W3KFINK7POTZ3J/events.json","paper":"https://pith.science/paper/5CER4WRO"},"agent_actions":{"view_html":"https://pith.science/pith/5CER4WROBUS3W3KFINK7POTZ3J","download_json":"https://pith.science/pith/5CER4WROBUS3W3KFINK7POTZ3J.json","view_paper":"https://pith.science/paper/5CER4WRO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.01824&json=true","fetch_graph":"https://pith.science/api/pith-number/5CER4WROBUS3W3KFINK7POTZ3J/graph.json","fetch_events":"https://pith.science/api/pith-number/5CER4WROBUS3W3KFINK7POTZ3J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5CER4WROBUS3W3KFINK7POTZ3J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5CER4WROBUS3W3KFINK7POTZ3J/action/storage_attestation","attest_author":"https://pith.science/pith/5CER4WROBUS3W3KFINK7POTZ3J/action/author_attestation","sign_citation":"https://pith.science/pith/5CER4WROBUS3W3KFINK7POTZ3J/action/citation_signature","submit_replication":"https://pith.science/pith/5CER4WROBUS3W3KFINK7POTZ3J/action/replication_record"}},"created_at":"2026-05-18T01:04:50.228057+00:00","updated_at":"2026-05-18T01:04:50.228057+00:00"}