{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IYYSSPPFMHM6QNXTVOWAORC2BG","short_pith_number":"pith:IYYSSPPF","canonical_record":{"source":{"id":"1712.10010","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-25T03:50:48Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"57b303ed5be0d27559d83902122141ac06fc1b7593638d37aeb65a50a5fbd236","abstract_canon_sha256":"5c01f114ebe53c80c30f59ce142c080d639a852f73f353a180e14fcb53b1c225"},"schema_version":"1.0"},"canonical_sha256":"4631293de561d9e836f3abac07445a0989e12ae27c00f0957111e3dc426c691f","source":{"kind":"arxiv","id":"1712.10010","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.10010","created_at":"2026-05-18T00:15:41Z"},{"alias_kind":"arxiv_version","alias_value":"1712.10010v2","created_at":"2026-05-18T00:15:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.10010","created_at":"2026-05-18T00:15:41Z"},{"alias_kind":"pith_short_12","alias_value":"IYYSSPPFMHM6","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IYYSSPPFMHM6QNXT","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IYYSSPPF","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IYYSSPPFMHM6QNXTVOWAORC2BG","target":"record","payload":{"canonical_record":{"source":{"id":"1712.10010","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-25T03:50:48Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"57b303ed5be0d27559d83902122141ac06fc1b7593638d37aeb65a50a5fbd236","abstract_canon_sha256":"5c01f114ebe53c80c30f59ce142c080d639a852f73f353a180e14fcb53b1c225"},"schema_version":"1.0"},"canonical_sha256":"4631293de561d9e836f3abac07445a0989e12ae27c00f0957111e3dc426c691f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:41.832066Z","signature_b64":"0X6e3ZW+KvYfR826lJVEDbY08ajtrbBOvYRhWnF13CYO4GIrSZVv4ZNIERGV9AjG5MkMVjb9whzb8kmmF1ENCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4631293de561d9e836f3abac07445a0989e12ae27c00f0957111e3dc426c691f","last_reissued_at":"2026-05-18T00:15:41.831432Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:41.831432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.10010","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-18T00:15:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BRH04hscM3qhR1t06P6HCIu9NvhWSvQJZ5nVr71kZUvj9vsGKhlXzDVydM/E8c0zfqzTXY8WkMcXsOlMl+M4DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:22:21.118717Z"},"content_sha256":"d28588dcd2cd372aed5a5e415ce513333ac5a9764f7d9ede5d444cadbca8d3a9","schema_version":"1.0","event_id":"sha256:d28588dcd2cd372aed5a5e415ce513333ac5a9764f7d9ede5d444cadbca8d3a9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IYYSSPPFMHM6QNXTVOWAORC2BG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Conflict-free connection of trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Hong Chang, Jingshu Zhang, Meng Ji, Xueliang Li","submitted_at":"2017-12-25T03:50:48Z","abstract_excerpt":"We study the conflict-free connection coloring of trees, which is also the conflict-free coloring of the so-called edge-path hypergraphs of trees. We first prove that for a tree $T$ of order $n$, $cfc(T)\\geq cfc(P_n)=\\lceil \\log_{2} n\\rceil$, which completely confirms the conjecture of Li and Wu. We then present a sharp upper bound for the conflict-free connection number of trees by a simple algorithm. Furthermore, we show that the conflict-free connection number of the binomial tree with $2^{k-1}$ vertices is $k-1$. At last, we study trees which are $cfc$-critical, and prove that if a tree $T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.10010","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-18T00:15:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uvsXJPslW3UOqsuRpez1tOEzrjbAKs36KVqJOMBfQdoXSZehLOIR2/W2s5/9aEktndbwrPF7zbQ3s+0w7HY7Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:22:21.119061Z"},"content_sha256":"3ca013564904d7ab670f841f4aaea69ee3883d9140c1ec74fbe4d5c524c41c01","schema_version":"1.0","event_id":"sha256:3ca013564904d7ab670f841f4aaea69ee3883d9140c1ec74fbe4d5c524c41c01"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IYYSSPPFMHM6QNXTVOWAORC2BG/bundle.json","state_url":"https://pith.science/pith/IYYSSPPFMHM6QNXTVOWAORC2BG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IYYSSPPFMHM6QNXTVOWAORC2BG/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-02T04:22:21Z","links":{"resolver":"https://pith.science/pith/IYYSSPPFMHM6QNXTVOWAORC2BG","bundle":"https://pith.science/pith/IYYSSPPFMHM6QNXTVOWAORC2BG/bundle.json","state":"https://pith.science/pith/IYYSSPPFMHM6QNXTVOWAORC2BG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IYYSSPPFMHM6QNXTVOWAORC2BG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IYYSSPPFMHM6QNXTVOWAORC2BG","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":"5c01f114ebe53c80c30f59ce142c080d639a852f73f353a180e14fcb53b1c225","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-25T03:50:48Z","title_canon_sha256":"57b303ed5be0d27559d83902122141ac06fc1b7593638d37aeb65a50a5fbd236"},"schema_version":"1.0","source":{"id":"1712.10010","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.10010","created_at":"2026-05-18T00:15:41Z"},{"alias_kind":"arxiv_version","alias_value":"1712.10010v2","created_at":"2026-05-18T00:15:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.10010","created_at":"2026-05-18T00:15:41Z"},{"alias_kind":"pith_short_12","alias_value":"IYYSSPPFMHM6","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IYYSSPPFMHM6QNXT","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IYYSSPPF","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:3ca013564904d7ab670f841f4aaea69ee3883d9140c1ec74fbe4d5c524c41c01","target":"graph","created_at":"2026-05-18T00:15:41Z","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":"We study the conflict-free connection coloring of trees, which is also the conflict-free coloring of the so-called edge-path hypergraphs of trees. We first prove that for a tree $T$ of order $n$, $cfc(T)\\geq cfc(P_n)=\\lceil \\log_{2} n\\rceil$, which completely confirms the conjecture of Li and Wu. We then present a sharp upper bound for the conflict-free connection number of trees by a simple algorithm. Furthermore, we show that the conflict-free connection number of the binomial tree with $2^{k-1}$ vertices is $k-1$. At last, we study trees which are $cfc$-critical, and prove that if a tree $T","authors_text":"Hong Chang, Jingshu Zhang, Meng Ji, Xueliang Li","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-25T03:50:48Z","title":"Conflict-free connection of trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.10010","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:d28588dcd2cd372aed5a5e415ce513333ac5a9764f7d9ede5d444cadbca8d3a9","target":"record","created_at":"2026-05-18T00:15:41Z","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":"5c01f114ebe53c80c30f59ce142c080d639a852f73f353a180e14fcb53b1c225","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-25T03:50:48Z","title_canon_sha256":"57b303ed5be0d27559d83902122141ac06fc1b7593638d37aeb65a50a5fbd236"},"schema_version":"1.0","source":{"id":"1712.10010","kind":"arxiv","version":2}},"canonical_sha256":"4631293de561d9e836f3abac07445a0989e12ae27c00f0957111e3dc426c691f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4631293de561d9e836f3abac07445a0989e12ae27c00f0957111e3dc426c691f","first_computed_at":"2026-05-18T00:15:41.831432Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:41.831432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0X6e3ZW+KvYfR826lJVEDbY08ajtrbBOvYRhWnF13CYO4GIrSZVv4ZNIERGV9AjG5MkMVjb9whzb8kmmF1ENCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:41.832066Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.10010","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d28588dcd2cd372aed5a5e415ce513333ac5a9764f7d9ede5d444cadbca8d3a9","sha256:3ca013564904d7ab670f841f4aaea69ee3883d9140c1ec74fbe4d5c524c41c01"],"state_sha256":"74145ace7b7a7eec46d6fd616bca6a9b9cccff760b1bae9aa54b7c4931c10b2b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9M+OlifIGXHTZnei7hzq8KYqWwa8urYhEn0eJWxhRdKBdDespWJeJzkUbSCXqo3Nb4fr/NzhjlRmIatflpqtBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:22:21.121006Z","bundle_sha256":"afa19b9030aa8abc14b3efebf75203d40f5163517bd21a58dd43bd00251e2966"}}