{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:TVYX5UT2HCKWB6QXQIJFCL6BN6","short_pith_number":"pith:TVYX5UT2","schema_version":"1.0","canonical_sha256":"9d717ed27a389560fa178212512fc16fb630562f7329d95c7e12a327a907a13f","source":{"kind":"arxiv","id":"1705.08316","version":1},"attestation_state":"computed","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)"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.08316","created_at":"2026-05-18T00:43:48.652731+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.08316v1","created_at":"2026-05-18T00:43:48.652731+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08316","created_at":"2026-05-18T00:43:48.652731+00:00"},{"alias_kind":"pith_short_12","alias_value":"TVYX5UT2HCKW","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"TVYX5UT2HCKWB6QX","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"TVYX5UT2","created_at":"2026-05-18T12:31:46.661854+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/TVYX5UT2HCKWB6QXQIJFCL6BN6","json":"https://pith.science/pith/TVYX5UT2HCKWB6QXQIJFCL6BN6.json","graph_json":"https://pith.science/api/pith-number/TVYX5UT2HCKWB6QXQIJFCL6BN6/graph.json","events_json":"https://pith.science/api/pith-number/TVYX5UT2HCKWB6QXQIJFCL6BN6/events.json","paper":"https://pith.science/paper/TVYX5UT2"},"agent_actions":{"view_html":"https://pith.science/pith/TVYX5UT2HCKWB6QXQIJFCL6BN6","download_json":"https://pith.science/pith/TVYX5UT2HCKWB6QXQIJFCL6BN6.json","view_paper":"https://pith.science/paper/TVYX5UT2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.08316&json=true","fetch_graph":"https://pith.science/api/pith-number/TVYX5UT2HCKWB6QXQIJFCL6BN6/graph.json","fetch_events":"https://pith.science/api/pith-number/TVYX5UT2HCKWB6QXQIJFCL6BN6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TVYX5UT2HCKWB6QXQIJFCL6BN6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TVYX5UT2HCKWB6QXQIJFCL6BN6/action/storage_attestation","attest_author":"https://pith.science/pith/TVYX5UT2HCKWB6QXQIJFCL6BN6/action/author_attestation","sign_citation":"https://pith.science/pith/TVYX5UT2HCKWB6QXQIJFCL6BN6/action/citation_signature","submit_replication":"https://pith.science/pith/TVYX5UT2HCKWB6QXQIJFCL6BN6/action/replication_record"}},"created_at":"2026-05-18T00:43:48.652731+00:00","updated_at":"2026-05-18T00:43:48.652731+00:00"}