{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RXWEZ6Q7FCDV3NWRAOKCSLDVER","short_pith_number":"pith:RXWEZ6Q7","schema_version":"1.0","canonical_sha256":"8dec4cfa1f28875db6d10394292c75245f1eb7a8189aafb5a693265839247753","source":{"kind":"arxiv","id":"1705.05317","version":1},"attestation_state":"computed","paper":{"title":"Conflict-free connection numbers of line graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo Deng, Haixing Zhao, Wenjing Li, Xueliang Li, Yaping Mao","submitted_at":"2017-05-15T16:28:00Z","abstract_excerpt":"A path in an edge-colored graph is called \\emph{conflict-free} if it contains at least one color used on exactly one of its edges. An edge-colored graph $G$ is \\emph{conflict-free connected} if for any two distinct vertices of $G$, there is a conflict-free path connecting them. For a connected graph $G$, the \\emph{conflict-free connection number} of $G$, denoted by $cfc(G)$, is defined as the minimum number of colors that are required to make $G$ conflict-free connected. In this paper, we investigate the conflict-free connection numbers of connected claw-free graphs, especially line graphs. We"},"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.05317","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-15T16:28:00Z","cross_cats_sorted":[],"title_canon_sha256":"d8595eea0398fb46694c6c5df5baa04cd100c1d399592b788f932a7430fe95fe","abstract_canon_sha256":"a43c704efef0f588c51058c029e449576501052978bdab057ed1dfe869bf8f95"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:30.836219Z","signature_b64":"LCehFvUN+XB+vU6drU08esid1cyqLH6CyzDIhqtcM5mIXnYyEmvOpvsPZ+f4twIRENmOBa9dG8PStnvkToi4DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8dec4cfa1f28875db6d10394292c75245f1eb7a8189aafb5a693265839247753","last_reissued_at":"2026-05-18T00:44:30.835698Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:30.835698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Conflict-free connection numbers of line graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo Deng, Haixing Zhao, Wenjing Li, Xueliang Li, Yaping Mao","submitted_at":"2017-05-15T16:28:00Z","abstract_excerpt":"A path in an edge-colored graph is called \\emph{conflict-free} if it contains at least one color used on exactly one of its edges. An edge-colored graph $G$ is \\emph{conflict-free connected} if for any two distinct vertices of $G$, there is a conflict-free path connecting them. For a connected graph $G$, the \\emph{conflict-free connection number} of $G$, denoted by $cfc(G)$, is defined as the minimum number of colors that are required to make $G$ conflict-free connected. In this paper, we investigate the conflict-free connection numbers of connected claw-free graphs, especially line graphs. We"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05317","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.05317","created_at":"2026-05-18T00:44:30.835763+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.05317v1","created_at":"2026-05-18T00:44:30.835763+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05317","created_at":"2026-05-18T00:44:30.835763+00:00"},{"alias_kind":"pith_short_12","alias_value":"RXWEZ6Q7FCDV","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"RXWEZ6Q7FCDV3NWR","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"RXWEZ6Q7","created_at":"2026-05-18T12:31:43.269735+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/RXWEZ6Q7FCDV3NWRAOKCSLDVER","json":"https://pith.science/pith/RXWEZ6Q7FCDV3NWRAOKCSLDVER.json","graph_json":"https://pith.science/api/pith-number/RXWEZ6Q7FCDV3NWRAOKCSLDVER/graph.json","events_json":"https://pith.science/api/pith-number/RXWEZ6Q7FCDV3NWRAOKCSLDVER/events.json","paper":"https://pith.science/paper/RXWEZ6Q7"},"agent_actions":{"view_html":"https://pith.science/pith/RXWEZ6Q7FCDV3NWRAOKCSLDVER","download_json":"https://pith.science/pith/RXWEZ6Q7FCDV3NWRAOKCSLDVER.json","view_paper":"https://pith.science/paper/RXWEZ6Q7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.05317&json=true","fetch_graph":"https://pith.science/api/pith-number/RXWEZ6Q7FCDV3NWRAOKCSLDVER/graph.json","fetch_events":"https://pith.science/api/pith-number/RXWEZ6Q7FCDV3NWRAOKCSLDVER/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RXWEZ6Q7FCDV3NWRAOKCSLDVER/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RXWEZ6Q7FCDV3NWRAOKCSLDVER/action/storage_attestation","attest_author":"https://pith.science/pith/RXWEZ6Q7FCDV3NWRAOKCSLDVER/action/author_attestation","sign_citation":"https://pith.science/pith/RXWEZ6Q7FCDV3NWRAOKCSLDVER/action/citation_signature","submit_replication":"https://pith.science/pith/RXWEZ6Q7FCDV3NWRAOKCSLDVER/action/replication_record"}},"created_at":"2026-05-18T00:44:30.835763+00:00","updated_at":"2026-05-18T00:44:30.835763+00:00"}