{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:TCPGAHTYPILA3HP2BVIODKQEPD","short_pith_number":"pith:TCPGAHTY","schema_version":"1.0","canonical_sha256":"989e601e787a160d9dfa0d50e1aa0478d10d262ffbab5f099b18cc5528586445","source":{"kind":"arxiv","id":"1705.07270","version":1},"attestation_state":"computed","paper":{"title":"Conflict-free vertex-connections of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Haixing Zhao, Xiaoyu Zhu, Xueliang Li, Yaping Mao, Yingying Zhang","submitted_at":"2017-05-20T07:30:24Z","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"},"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":"1705.07270","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-20T07:30:24Z","cross_cats_sorted":[],"title_canon_sha256":"dc18d2a8c26951b61a481de0da25234e060720a11d4d19e1cab9b6a03aa5ddeb","abstract_canon_sha256":"b7201aa3fa886002714d5125a827b9f794a21fe289129a51c0cd9704aad95425"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:06.142184Z","signature_b64":"qGQgsolABLHxrj58DSNT+9Bx+xXAcNiQTm6IWGM9riy8TDVgDP/031RiJh/OkOgB0KpsQSBxosPbf/nkOiETBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"989e601e787a160d9dfa0d50e1aa0478d10d262ffbab5f099b18cc5528586445","last_reissued_at":"2026-05-18T00:44:06.141510Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:06.141510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Conflict-free vertex-connections of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Haixing Zhao, Xiaoyu Zhu, Xueliang Li, Yaping Mao, Yingying Zhang","submitted_at":"2017-05-20T07:30:24Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07270","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":"1705.07270","created_at":"2026-05-18T00:44:06.141597+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.07270v1","created_at":"2026-05-18T00:44:06.141597+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07270","created_at":"2026-05-18T00:44:06.141597+00:00"},{"alias_kind":"pith_short_12","alias_value":"TCPGAHTYPILA","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"TCPGAHTYPILA3HP2","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"TCPGAHTY","created_at":"2026-05-18T12:31:46.661854+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/TCPGAHTYPILA3HP2BVIODKQEPD","json":"https://pith.science/pith/TCPGAHTYPILA3HP2BVIODKQEPD.json","graph_json":"https://pith.science/api/pith-number/TCPGAHTYPILA3HP2BVIODKQEPD/graph.json","events_json":"https://pith.science/api/pith-number/TCPGAHTYPILA3HP2BVIODKQEPD/events.json","paper":"https://pith.science/paper/TCPGAHTY"},"agent_actions":{"view_html":"https://pith.science/pith/TCPGAHTYPILA3HP2BVIODKQEPD","download_json":"https://pith.science/pith/TCPGAHTYPILA3HP2BVIODKQEPD.json","view_paper":"https://pith.science/paper/TCPGAHTY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.07270&json=true","fetch_graph":"https://pith.science/api/pith-number/TCPGAHTYPILA3HP2BVIODKQEPD/graph.json","fetch_events":"https://pith.science/api/pith-number/TCPGAHTYPILA3HP2BVIODKQEPD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TCPGAHTYPILA3HP2BVIODKQEPD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TCPGAHTYPILA3HP2BVIODKQEPD/action/storage_attestation","attest_author":"https://pith.science/pith/TCPGAHTYPILA3HP2BVIODKQEPD/action/author_attestation","sign_citation":"https://pith.science/pith/TCPGAHTYPILA3HP2BVIODKQEPD/action/citation_signature","submit_replication":"https://pith.science/pith/TCPGAHTYPILA3HP2BVIODKQEPD/action/replication_record"}},"created_at":"2026-05-18T00:44:06.141597+00:00","updated_at":"2026-05-18T00:44:06.141597+00:00"}