{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:Y2VBXFFNO7OLW7LYW2YYYR2CP3","short_pith_number":"pith:Y2VBXFFN","schema_version":"1.0","canonical_sha256":"c6aa1b94ad77dcbb7d78b6b18c47427ed965cdc448540f2e27892277a8e0299c","source":{"kind":"arxiv","id":"1902.10881","version":2},"attestation_state":"computed","paper":{"title":"Conflict-free (vertex)-connection numbers of graphs with small diameters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xiaoyu Zhu, Xueliang Li","submitted_at":"2019-02-28T03:49:40Z","abstract_excerpt":"A path in an(a) edge(vertex)-colored graph is called a conflict-free path if there exists a color used on only one of its edges(vertices). An(A) edge(vertex)-colored graph is called conflict-free (vertex-)connected if for each pair of distinct vertices, there is a conflict-free path connecting them. For a connected graph $G$, the conflict-free (vertex-)connection number of $G$, denoted by $cfc(G)(\\text{or}~vcfc(G))$, is defined as the smallest number of colors that are required to make $G$ conflict-free (vertex-)connected. In this paper, we first give the exact value $cfc(T)$ for any tree $T$ "},"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":"1902.10881","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-28T03:49:40Z","cross_cats_sorted":[],"title_canon_sha256":"d890281892b5afe6f966abbbdd1c72cf0b5676d8f33f96b95528aa4bcbff3f3e","abstract_canon_sha256":"ca1d158449fc7175ef04c52be7c14f55fdb4afbe97a7c562bad887dacf5ede54"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:54.896476Z","signature_b64":"D27FagSlq6AoD7mbr1OVBZx1qI9OOO6ThHtaTVyI23JrODl6kClVqPFgycc36PqmkPTX/dSy9MZG1TFzeqzWCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6aa1b94ad77dcbb7d78b6b18c47427ed965cdc448540f2e27892277a8e0299c","last_reissued_at":"2026-05-17T23:48:54.895854Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:54.895854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Conflict-free (vertex)-connection numbers of graphs with small diameters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xiaoyu Zhu, Xueliang Li","submitted_at":"2019-02-28T03:49:40Z","abstract_excerpt":"A path in an(a) edge(vertex)-colored graph is called a conflict-free path if there exists a color used on only one of its edges(vertices). An(A) edge(vertex)-colored graph is called conflict-free (vertex-)connected if for each pair of distinct vertices, there is a conflict-free path connecting them. For a connected graph $G$, the conflict-free (vertex-)connection number of $G$, denoted by $cfc(G)(\\text{or}~vcfc(G))$, is defined as the smallest number of colors that are required to make $G$ conflict-free (vertex-)connected. In this paper, we first give the exact value $cfc(T)$ for any tree $T$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10881","kind":"arxiv","version":2},"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":"1902.10881","created_at":"2026-05-17T23:48:54.895943+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.10881v2","created_at":"2026-05-17T23:48:54.895943+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10881","created_at":"2026-05-17T23:48:54.895943+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y2VBXFFNO7OL","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y2VBXFFNO7OLW7LY","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y2VBXFFN","created_at":"2026-05-18T12:33:33.725879+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/Y2VBXFFNO7OLW7LYW2YYYR2CP3","json":"https://pith.science/pith/Y2VBXFFNO7OLW7LYW2YYYR2CP3.json","graph_json":"https://pith.science/api/pith-number/Y2VBXFFNO7OLW7LYW2YYYR2CP3/graph.json","events_json":"https://pith.science/api/pith-number/Y2VBXFFNO7OLW7LYW2YYYR2CP3/events.json","paper":"https://pith.science/paper/Y2VBXFFN"},"agent_actions":{"view_html":"https://pith.science/pith/Y2VBXFFNO7OLW7LYW2YYYR2CP3","download_json":"https://pith.science/pith/Y2VBXFFNO7OLW7LYW2YYYR2CP3.json","view_paper":"https://pith.science/paper/Y2VBXFFN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.10881&json=true","fetch_graph":"https://pith.science/api/pith-number/Y2VBXFFNO7OLW7LYW2YYYR2CP3/graph.json","fetch_events":"https://pith.science/api/pith-number/Y2VBXFFNO7OLW7LYW2YYYR2CP3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y2VBXFFNO7OLW7LYW2YYYR2CP3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y2VBXFFNO7OLW7LYW2YYYR2CP3/action/storage_attestation","attest_author":"https://pith.science/pith/Y2VBXFFNO7OLW7LYW2YYYR2CP3/action/author_attestation","sign_citation":"https://pith.science/pith/Y2VBXFFNO7OLW7LYW2YYYR2CP3/action/citation_signature","submit_replication":"https://pith.science/pith/Y2VBXFFNO7OLW7LYW2YYYR2CP3/action/replication_record"}},"created_at":"2026-05-17T23:48:54.895943+00:00","updated_at":"2026-05-17T23:48:54.895943+00:00"}