{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PCTR3OP4VIJELGJZDKDCAI3X6K","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":"1f40be69a16a1486f179d81db1a251f68174aa155282b835e9abaf2cfb918752","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-16T15:48:32Z","title_canon_sha256":"0608f8c519c09565d81f32408d9ba5d400f62af491634283107fd1c98f3b1b30"},"schema_version":"1.0","source":{"id":"1610.04874","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.04874","created_at":"2026-05-18T00:45:58Z"},{"alias_kind":"arxiv_version","alias_value":"1610.04874v2","created_at":"2026-05-18T00:45:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04874","created_at":"2026-05-18T00:45:58Z"},{"alias_kind":"pith_short_12","alias_value":"PCTR3OP4VIJE","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PCTR3OP4VIJELGJZ","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PCTR3OP4","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:73cc2b6efb39f4b9471d86a47d16a5376e1be28f368641731958004e5aa63fed","target":"graph","created_at":"2026-05-18T00:45:58Z","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":"For a connected graph, we define the proper-walk connection number as the minimum number of colors needed to color the edges of a graph so that there is a walk between every pair of vertices without two consecutive edges having the same color. We show that the proper-walk connection number is at most three for all cyclic graphs, and at most two for bridgeless graphs. We also characterize the bipartite graphs that have proper-walk connection number equal to two, and show that this characterization also holds for the analogous problem where one is restricted to properly colored paths.","authors_text":"Robert Melville, Wayne Goddard","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-16T15:48:32Z","title":"Coloring Graphs to Produce Properly Colored Walks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04874","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:29eecb9d11ad518fd3e4c5f3d93271cd4a9875817f2733f7c1c6d0af4f756b1c","target":"record","created_at":"2026-05-18T00:45:58Z","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":"1f40be69a16a1486f179d81db1a251f68174aa155282b835e9abaf2cfb918752","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-16T15:48:32Z","title_canon_sha256":"0608f8c519c09565d81f32408d9ba5d400f62af491634283107fd1c98f3b1b30"},"schema_version":"1.0","source":{"id":"1610.04874","kind":"arxiv","version":2}},"canonical_sha256":"78a71db9fcaa124599391a86202377f297350e714320a189b502512acf61b40c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78a71db9fcaa124599391a86202377f297350e714320a189b502512acf61b40c","first_computed_at":"2026-05-18T00:45:58.568784Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:58.568784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2esRmleQcpApLhS4ob6IBQDWgnrdQ19oE10c60dS7qUjvUQ8HRAlU5VBnQKJqrii2NSaPBGeZi7wbN20PVgYDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:58.569239Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.04874","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:29eecb9d11ad518fd3e4c5f3d93271cd4a9875817f2733f7c1c6d0af4f756b1c","sha256:73cc2b6efb39f4b9471d86a47d16a5376e1be28f368641731958004e5aa63fed"],"state_sha256":"29cb51316d9b0aa3f79e5a1bff492fbbdd6045370165bc52637d5cc92098ebae"}