{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TCPGAHTYPILA3HP2BVIODKQEPD","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":"b7201aa3fa886002714d5125a827b9f794a21fe289129a51c0cd9704aad95425","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-20T07:30:24Z","title_canon_sha256":"dc18d2a8c26951b61a481de0da25234e060720a11d4d19e1cab9b6a03aa5ddeb"},"schema_version":"1.0","source":{"id":"1705.07270","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07270","created_at":"2026-05-18T00:44:06Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07270v1","created_at":"2026-05-18T00:44:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07270","created_at":"2026-05-18T00:44:06Z"},{"alias_kind":"pith_short_12","alias_value":"TCPGAHTYPILA","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TCPGAHTYPILA3HP2","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TCPGAHTY","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:e3d9f1b9073b08289da15673a1d8cebc88bb59d6bcd7df94b91a78434c4e4a92","target":"graph","created_at":"2026-05-18T00:44:06Z","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":"A path in a vertex-colored graph is called \\emph{conflict free} if there is a color used on exactly one of its vertices. A vertex-colored graph is said to be \\emph{conflict-free vertex-connected} if any two vertices of the graph are connected by a conflict-free path. This paper investigates the question: For a connected graph $G$, what is the smallest number of colors needed in a vertex-coloring of $G$ in order to make $G$ conflict-free vertex-connected. As a result, we get that the answer is easy for $2$-connected graphs, and very difficult for connected graphs with more cut-vertices, includi","authors_text":"Haixing Zhao, Xiaoyu Zhu, Xueliang Li, Yaping Mao, Yingying Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-20T07:30:24Z","title":"Conflict-free vertex-connections of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07270","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:73de80bca8f5c921a4fe9371316059744c037a8ce3b2c0c55730f08fa820647e","target":"record","created_at":"2026-05-18T00:44:06Z","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":"b7201aa3fa886002714d5125a827b9f794a21fe289129a51c0cd9704aad95425","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-20T07:30:24Z","title_canon_sha256":"dc18d2a8c26951b61a481de0da25234e060720a11d4d19e1cab9b6a03aa5ddeb"},"schema_version":"1.0","source":{"id":"1705.07270","kind":"arxiv","version":1}},"canonical_sha256":"989e601e787a160d9dfa0d50e1aa0478d10d262ffbab5f099b18cc5528586445","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"989e601e787a160d9dfa0d50e1aa0478d10d262ffbab5f099b18cc5528586445","first_computed_at":"2026-05-18T00:44:06.141510Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:06.141510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qGQgsolABLHxrj58DSNT+9Bx+xXAcNiQTm6IWGM9riy8TDVgDP/031RiJh/OkOgB0KpsQSBxosPbf/nkOiETBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:06.142184Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.07270","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73de80bca8f5c921a4fe9371316059744c037a8ce3b2c0c55730f08fa820647e","sha256:e3d9f1b9073b08289da15673a1d8cebc88bb59d6bcd7df94b91a78434c4e4a92"],"state_sha256":"867cca780ca884e56a0777d1d7ecd2743fb1723b2379018471e5cab6b535f1e7"}