{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TVYX5UT2HCKWB6QXQIJFCL6BN6","short_pith_number":"pith:TVYX5UT2","canonical_record":{"source":{"id":"1705.08316","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-23T14:30:54Z","cross_cats_sorted":[],"title_canon_sha256":"1267b629c33fdd6fc0d2d152698f44da246ea9134530875aac5372b11ecb0fb2","abstract_canon_sha256":"26c47a568d724b3967bb738ecda65315fa1b89b5faafce34bdfeb32efb64d0e5"},"schema_version":"1.0"},"canonical_sha256":"9d717ed27a389560fa178212512fc16fb630562f7329d95c7e12a327a907a13f","source":{"kind":"arxiv","id":"1705.08316","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.08316","created_at":"2026-05-18T00:43:48Z"},{"alias_kind":"arxiv_version","alias_value":"1705.08316v1","created_at":"2026-05-18T00:43:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08316","created_at":"2026-05-18T00:43:48Z"},{"alias_kind":"pith_short_12","alias_value":"TVYX5UT2HCKW","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TVYX5UT2HCKWB6QX","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TVYX5UT2","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TVYX5UT2HCKWB6QXQIJFCL6BN6","target":"record","payload":{"canonical_record":{"source":{"id":"1705.08316","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-23T14:30:54Z","cross_cats_sorted":[],"title_canon_sha256":"1267b629c33fdd6fc0d2d152698f44da246ea9134530875aac5372b11ecb0fb2","abstract_canon_sha256":"26c47a568d724b3967bb738ecda65315fa1b89b5faafce34bdfeb32efb64d0e5"},"schema_version":"1.0"},"canonical_sha256":"9d717ed27a389560fa178212512fc16fb630562f7329d95c7e12a327a907a13f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:48.653347Z","signature_b64":"eWmkxm0wK1GoeXcvGMa+6KEOFCQUJX8TlFlk18nsqat8NSBASltnj4iC3KdyuI1NvYyl854j8KbfTuWPjyXIDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d717ed27a389560fa178212512fc16fb630562f7329d95c7e12a327a907a13f","last_reissued_at":"2026-05-18T00:43:48.652601Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:48.652601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.08316","source_version":1,"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:43:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C7gYuYQc+tUq/+iMunO/5YbB+GRUziOjt/PdR2nGCSHR39b6Kk9jAKrQpObCi+6nudcldt+RhKjxzy28I51QDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:30:18.824535Z"},"content_sha256":"3081a9446a3e6696e6a3ec9f5220eebec8900a5166074fa5aca68992b99d27c1","schema_version":"1.0","event_id":"sha256:3081a9446a3e6696e6a3ec9f5220eebec8900a5166074fa5aca68992b99d27c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TVYX5UT2HCKWB6QXQIJFCL6BN6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nordhaus-Gaddum-type theorem for conflict-free connection number of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Haixing Zhao, Hong Chang, Xueliang Li, Yaping Mao, Zhong Huang","submitted_at":"2017-05-23T14:30:54Z","abstract_excerpt":"An edge-colored graph $G$ is \\emph{conflict-free connected} if, between each pair of distinct vertices, there exists a path containing a color used on exactly one of its edges. The \\emph{conflict-free connection number} of a connected graph $G$, denoted by $cfc(G)$, is defined as the smallest number of colors that are needed in order to make $G$ conflict-free connected. In this paper, we determine all trees $T$ of order $n$ for which $cfc(T)=n-t$, where $t\\geq 1$ and $n\\geq 2t+2 $. Then we prove that $1\\leq cfc(G)\\leq n-1$ for a connected graph $G$, and characterize the graphs $G$ with $cfc(G)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08316","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"},"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:43:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DTutGIuqjNoQKJr9wz2Da5PNzBHiLmiwHyBZepMFXd7jUtEaoYseVPQX+0SzIariVRk2e4dEWcMSz06/WFxcBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:30:18.824884Z"},"content_sha256":"15bb75a82916572b1988d9e683775a7346bc9a68798cc00f3a49100943d751a9","schema_version":"1.0","event_id":"sha256:15bb75a82916572b1988d9e683775a7346bc9a68798cc00f3a49100943d751a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TVYX5UT2HCKWB6QXQIJFCL6BN6/bundle.json","state_url":"https://pith.science/pith/TVYX5UT2HCKWB6QXQIJFCL6BN6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TVYX5UT2HCKWB6QXQIJFCL6BN6/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-01T08:30:18Z","links":{"resolver":"https://pith.science/pith/TVYX5UT2HCKWB6QXQIJFCL6BN6","bundle":"https://pith.science/pith/TVYX5UT2HCKWB6QXQIJFCL6BN6/bundle.json","state":"https://pith.science/pith/TVYX5UT2HCKWB6QXQIJFCL6BN6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TVYX5UT2HCKWB6QXQIJFCL6BN6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TVYX5UT2HCKWB6QXQIJFCL6BN6","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":"26c47a568d724b3967bb738ecda65315fa1b89b5faafce34bdfeb32efb64d0e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-23T14:30:54Z","title_canon_sha256":"1267b629c33fdd6fc0d2d152698f44da246ea9134530875aac5372b11ecb0fb2"},"schema_version":"1.0","source":{"id":"1705.08316","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.08316","created_at":"2026-05-18T00:43:48Z"},{"alias_kind":"arxiv_version","alias_value":"1705.08316v1","created_at":"2026-05-18T00:43:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08316","created_at":"2026-05-18T00:43:48Z"},{"alias_kind":"pith_short_12","alias_value":"TVYX5UT2HCKW","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TVYX5UT2HCKWB6QX","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TVYX5UT2","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:15bb75a82916572b1988d9e683775a7346bc9a68798cc00f3a49100943d751a9","target":"graph","created_at":"2026-05-18T00:43:48Z","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":"An edge-colored graph $G$ is \\emph{conflict-free connected} if, between each pair of distinct vertices, there exists a path containing a color used on exactly one of its edges. The \\emph{conflict-free connection number} of a connected graph $G$, denoted by $cfc(G)$, is defined as the smallest number of colors that are needed in order to make $G$ conflict-free connected. In this paper, we determine all trees $T$ of order $n$ for which $cfc(T)=n-t$, where $t\\geq 1$ and $n\\geq 2t+2 $. Then we prove that $1\\leq cfc(G)\\leq n-1$ for a connected graph $G$, and characterize the graphs $G$ with $cfc(G)","authors_text":"Haixing Zhao, Hong Chang, Xueliang Li, Yaping Mao, Zhong Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-23T14:30:54Z","title":"Nordhaus-Gaddum-type theorem for conflict-free connection number of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08316","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:3081a9446a3e6696e6a3ec9f5220eebec8900a5166074fa5aca68992b99d27c1","target":"record","created_at":"2026-05-18T00:43:48Z","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":"26c47a568d724b3967bb738ecda65315fa1b89b5faafce34bdfeb32efb64d0e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-23T14:30:54Z","title_canon_sha256":"1267b629c33fdd6fc0d2d152698f44da246ea9134530875aac5372b11ecb0fb2"},"schema_version":"1.0","source":{"id":"1705.08316","kind":"arxiv","version":1}},"canonical_sha256":"9d717ed27a389560fa178212512fc16fb630562f7329d95c7e12a327a907a13f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d717ed27a389560fa178212512fc16fb630562f7329d95c7e12a327a907a13f","first_computed_at":"2026-05-18T00:43:48.652601Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:48.652601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eWmkxm0wK1GoeXcvGMa+6KEOFCQUJX8TlFlk18nsqat8NSBASltnj4iC3KdyuI1NvYyl854j8KbfTuWPjyXIDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:48.653347Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.08316","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3081a9446a3e6696e6a3ec9f5220eebec8900a5166074fa5aca68992b99d27c1","sha256:15bb75a82916572b1988d9e683775a7346bc9a68798cc00f3a49100943d751a9"],"state_sha256":"78b6857c17192bb77a1574914338e4274fd5c3275e0e4c203fb670d47d091fd8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3LTiOgCP/qae8Nn+fV6K7cqZor7gRj63OaH0vqmiW4/SM2+k1rhNXTiuUepMzHLbNRmn7/82Vc5e4NXCCmaRDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T08:30:18.826990Z","bundle_sha256":"c66c56e5f85c33283013806ddf90bf15e93bf43f5c29a1cbd8f92cd819ffb67a"}}