{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QC3SVWMUZPCNCA46HDA4F5KDO7","short_pith_number":"pith:QC3SVWMU","schema_version":"1.0","canonical_sha256":"80b72ad994cbc4d1039e38c1c2f54377cf33939fb2c9f2d82860082862231b61","source":{"kind":"arxiv","id":"1707.01634","version":2},"attestation_state":"computed","paper":{"title":"Graphs with conflict-free connection number two","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hong Chang, Ingo Schiermeyer, Stanislav Jendrol', Trung Duy Doan, Xueliang Li, Zhong Huang","submitted_at":"2017-07-06T04:47:26Z","abstract_excerpt":"An edge-colored graph $G$ is \\emph{conflict-free connected} if any two of its vertices are connected by a path, which contains 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 the smallest number of colors needed in order to make $G$ conflict-free connected. For a graph $G,$ let $C(G)$ be the subgraph of $G$ induced by its set of cut-edges. In this paper, we first show that, if $G$ is a connected non-complete graph $G$ of order $n\\geq 9$ with $C(G)$ being a linear forest and with the minimum degree %$\\delta(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":"1707.01634","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-06T04:47:26Z","cross_cats_sorted":[],"title_canon_sha256":"341c595a00aca8c38965b19bc31999e4c653da34329df148e2c17f01c8b8a59d","abstract_canon_sha256":"a797cd1e7e5fc06f25236feb868db28737f5af0e5cb043196c3afe7231203a3e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:36.906113Z","signature_b64":"/lGFOuTqYGIN+9TJ6f6dfXUUK59npeS2GCgQXNTDXxlgVUdtKJpJrCpJxE09Gnr4dBVqRq3erxiK9a2vQ+rqAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80b72ad994cbc4d1039e38c1c2f54377cf33939fb2c9f2d82860082862231b61","last_reissued_at":"2026-05-18T00:16:36.905491Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:36.905491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graphs with conflict-free connection number two","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hong Chang, Ingo Schiermeyer, Stanislav Jendrol', Trung Duy Doan, Xueliang Li, Zhong Huang","submitted_at":"2017-07-06T04:47:26Z","abstract_excerpt":"An edge-colored graph $G$ is \\emph{conflict-free connected} if any two of its vertices are connected by a path, which contains 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 the smallest number of colors needed in order to make $G$ conflict-free connected. For a graph $G,$ let $C(G)$ be the subgraph of $G$ induced by its set of cut-edges. In this paper, we first show that, if $G$ is a connected non-complete graph $G$ of order $n\\geq 9$ with $C(G)$ being a linear forest and with the minimum degree %$\\delta(G"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01634","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":"1707.01634","created_at":"2026-05-18T00:16:36.905558+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.01634v2","created_at":"2026-05-18T00:16:36.905558+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01634","created_at":"2026-05-18T00:16:36.905558+00:00"},{"alias_kind":"pith_short_12","alias_value":"QC3SVWMUZPCN","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"QC3SVWMUZPCNCA46","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"QC3SVWMU","created_at":"2026-05-18T12:31:37.085036+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/QC3SVWMUZPCNCA46HDA4F5KDO7","json":"https://pith.science/pith/QC3SVWMUZPCNCA46HDA4F5KDO7.json","graph_json":"https://pith.science/api/pith-number/QC3SVWMUZPCNCA46HDA4F5KDO7/graph.json","events_json":"https://pith.science/api/pith-number/QC3SVWMUZPCNCA46HDA4F5KDO7/events.json","paper":"https://pith.science/paper/QC3SVWMU"},"agent_actions":{"view_html":"https://pith.science/pith/QC3SVWMUZPCNCA46HDA4F5KDO7","download_json":"https://pith.science/pith/QC3SVWMUZPCNCA46HDA4F5KDO7.json","view_paper":"https://pith.science/paper/QC3SVWMU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.01634&json=true","fetch_graph":"https://pith.science/api/pith-number/QC3SVWMUZPCNCA46HDA4F5KDO7/graph.json","fetch_events":"https://pith.science/api/pith-number/QC3SVWMUZPCNCA46HDA4F5KDO7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QC3SVWMUZPCNCA46HDA4F5KDO7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QC3SVWMUZPCNCA46HDA4F5KDO7/action/storage_attestation","attest_author":"https://pith.science/pith/QC3SVWMUZPCNCA46HDA4F5KDO7/action/author_attestation","sign_citation":"https://pith.science/pith/QC3SVWMUZPCNCA46HDA4F5KDO7/action/citation_signature","submit_replication":"https://pith.science/pith/QC3SVWMUZPCNCA46HDA4F5KDO7/action/replication_record"}},"created_at":"2026-05-18T00:16:36.905558+00:00","updated_at":"2026-05-18T00:16:36.905558+00:00"}