{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:Y2VBXFFNO7OLW7LYW2YYYR2CP3","short_pith_number":"pith:Y2VBXFFN","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"},"canonical_sha256":"c6aa1b94ad77dcbb7d78b6b18c47427ed965cdc448540f2e27892277a8e0299c","source":{"kind":"arxiv","id":"1902.10881","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10881","created_at":"2026-05-17T23:48:54Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10881v2","created_at":"2026-05-17T23:48:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10881","created_at":"2026-05-17T23:48:54Z"},{"alias_kind":"pith_short_12","alias_value":"Y2VBXFFNO7OL","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"Y2VBXFFNO7OLW7LY","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"Y2VBXFFN","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:Y2VBXFFNO7OLW7LYW2YYYR2CP3","target":"record","payload":{"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"},"canonical_sha256":"c6aa1b94ad77dcbb7d78b6b18c47427ed965cdc448540f2e27892277a8e0299c","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"},"source_kind":"arxiv","source_id":"1902.10881","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:48:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qGMdeJYV1OGDapIkx6PloFL/lUTbX2EY4ui/oqIAkRtN7lfD37zpc07pPYgfLNDwKexwNblZBS80ZgNGjrnHCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:56:50.113815Z"},"content_sha256":"852419895cdf48969e0748a5f2416dbb5b4c4301124f86e4183297d52dc3873b","schema_version":"1.0","event_id":"sha256:852419895cdf48969e0748a5f2416dbb5b4c4301124f86e4183297d52dc3873b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:Y2VBXFFNO7OLW7LYW2YYYR2CP3","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:48:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LtNYQ/QUOK5eh60Zkq/1CdQmxQvYDPe+E97zW43NPwllYdlAVzl/UU7DMC/POkWY934XTIQeXYoAtBF5QGYMAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:56:50.114344Z"},"content_sha256":"02691ebb4175c516087df1d8d669ef5770d3ece24cd91db17e11464d389c9509","schema_version":"1.0","event_id":"sha256:02691ebb4175c516087df1d8d669ef5770d3ece24cd91db17e11464d389c9509"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y2VBXFFNO7OLW7LYW2YYYR2CP3/bundle.json","state_url":"https://pith.science/pith/Y2VBXFFNO7OLW7LYW2YYYR2CP3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y2VBXFFNO7OLW7LYW2YYYR2CP3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T16:56:50Z","links":{"resolver":"https://pith.science/pith/Y2VBXFFNO7OLW7LYW2YYYR2CP3","bundle":"https://pith.science/pith/Y2VBXFFNO7OLW7LYW2YYYR2CP3/bundle.json","state":"https://pith.science/pith/Y2VBXFFNO7OLW7LYW2YYYR2CP3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y2VBXFFNO7OLW7LYW2YYYR2CP3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:Y2VBXFFNO7OLW7LYW2YYYR2CP3","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":"ca1d158449fc7175ef04c52be7c14f55fdb4afbe97a7c562bad887dacf5ede54","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-28T03:49:40Z","title_canon_sha256":"d890281892b5afe6f966abbbdd1c72cf0b5676d8f33f96b95528aa4bcbff3f3e"},"schema_version":"1.0","source":{"id":"1902.10881","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10881","created_at":"2026-05-17T23:48:54Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10881v2","created_at":"2026-05-17T23:48:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10881","created_at":"2026-05-17T23:48:54Z"},{"alias_kind":"pith_short_12","alias_value":"Y2VBXFFNO7OL","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"Y2VBXFFNO7OLW7LY","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"Y2VBXFFN","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:02691ebb4175c516087df1d8d669ef5770d3ece24cd91db17e11464d389c9509","target":"graph","created_at":"2026-05-17T23:48:54Z","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 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$ ","authors_text":"Xiaoyu Zhu, Xueliang Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-28T03:49:40Z","title":"Conflict-free (vertex)-connection numbers of graphs with small diameters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10881","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:852419895cdf48969e0748a5f2416dbb5b4c4301124f86e4183297d52dc3873b","target":"record","created_at":"2026-05-17T23:48:54Z","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":"ca1d158449fc7175ef04c52be7c14f55fdb4afbe97a7c562bad887dacf5ede54","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-28T03:49:40Z","title_canon_sha256":"d890281892b5afe6f966abbbdd1c72cf0b5676d8f33f96b95528aa4bcbff3f3e"},"schema_version":"1.0","source":{"id":"1902.10881","kind":"arxiv","version":2}},"canonical_sha256":"c6aa1b94ad77dcbb7d78b6b18c47427ed965cdc448540f2e27892277a8e0299c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c6aa1b94ad77dcbb7d78b6b18c47427ed965cdc448540f2e27892277a8e0299c","first_computed_at":"2026-05-17T23:48:54.895854Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:54.895854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D27FagSlq6AoD7mbr1OVBZx1qI9OOO6ThHtaTVyI23JrODl6kClVqPFgycc36PqmkPTX/dSy9MZG1TFzeqzWCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:54.896476Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.10881","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:852419895cdf48969e0748a5f2416dbb5b4c4301124f86e4183297d52dc3873b","sha256:02691ebb4175c516087df1d8d669ef5770d3ece24cd91db17e11464d389c9509"],"state_sha256":"4b3ce2595b8db99a183099c3a9f006d2b47e61a46fc25cb3c05cb9a54cee4209"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"caRaTfF04K6TDeU6kR9E2vo4wv91+VObZkUDq0dS9Gy/Zj5iD4Sb0e4Kl1XkHrX1NEoTEaL8l3TOl6K0o6XuDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T16:56:50.116969Z","bundle_sha256":"43762b9d81520b9af73070f2b0fa0a6a17827374ce04961efca70048901691f6"}}