{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GXPUJJI6S65MC4IT6ZMRO2ZVKJ","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":"38c954ff83cea65bd900faecdea324fb6fc4f67748c38b5384a788f9b628e5bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-05T03:37:41Z","title_canon_sha256":"7fdf3a66b60deec0591a25d5c4b00d45c46c7b534fc2ab2bdc7c2a1272fdc210"},"schema_version":"1.0","source":{"id":"1709.01225","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01225","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01225v1","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01225","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"pith_short_12","alias_value":"GXPUJJI6S65M","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GXPUJJI6S65MC4IT","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GXPUJJI6","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:b227366ce0d0495933b3ac2a2e76faf693b9f9083b1db4e517b7abd47fa64106","target":"graph","created_at":"2026-05-18T00:36:00Z","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 {\\it conflict-free} if there is a color used on exactly one of its vertices. A vertex-colored graph is said to be {\\it conflict-free vertex-connected} if any two vertices of the graph are connected by a conflict-free path. The {\\it conflict-free vertex-connection number}, denoted by $vcfc(G)$, is defined as the smallest number of colors required to make $G$ conflict-free vertex-connected. Li et al. conjectured that for a connected graph $G$ of order $n$, $vcfc(G)\\leq vcfc(P_n)$. We confirm that the conjecture is true and pose a a relevant conjecture c","authors_text":"Baoyindureng Wu, Zhenzhen Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-05T03:37:41Z","title":"On the maximum value of conflict-free verex-connection number of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01225","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:be748703c78f812615a32263589317a87506e491125daf0999d91450540aef19","target":"record","created_at":"2026-05-18T00:36:00Z","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":"38c954ff83cea65bd900faecdea324fb6fc4f67748c38b5384a788f9b628e5bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-05T03:37:41Z","title_canon_sha256":"7fdf3a66b60deec0591a25d5c4b00d45c46c7b534fc2ab2bdc7c2a1272fdc210"},"schema_version":"1.0","source":{"id":"1709.01225","kind":"arxiv","version":1}},"canonical_sha256":"35df44a51e97bac17113f659176b35524c70096626a41838e1fdd1450c52794a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"35df44a51e97bac17113f659176b35524c70096626a41838e1fdd1450c52794a","first_computed_at":"2026-05-18T00:36:00.633510Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:00.633510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W4GIchtUCRvGX8EJ9ks1HF+LTihK/a0qaeMpknRzeGYEGnBzZIzv2N4oKA5NUehKCYWMRTFZks2cTeeGYHt8CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:00.633885Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.01225","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be748703c78f812615a32263589317a87506e491125daf0999d91450540aef19","sha256:b227366ce0d0495933b3ac2a2e76faf693b9f9083b1db4e517b7abd47fa64106"],"state_sha256":"1083df5c2bce52caba341d3a8eff3344e04ee8d42d31d761c2b8023352cbc74f"}