{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RXWEZ6Q7FCDV3NWRAOKCSLDVER","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":"a43c704efef0f588c51058c029e449576501052978bdab057ed1dfe869bf8f95","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-15T16:28:00Z","title_canon_sha256":"d8595eea0398fb46694c6c5df5baa04cd100c1d399592b788f932a7430fe95fe"},"schema_version":"1.0","source":{"id":"1705.05317","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.05317","created_at":"2026-05-18T00:44:30Z"},{"alias_kind":"arxiv_version","alias_value":"1705.05317v1","created_at":"2026-05-18T00:44:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05317","created_at":"2026-05-18T00:44:30Z"},{"alias_kind":"pith_short_12","alias_value":"RXWEZ6Q7FCDV","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"RXWEZ6Q7FCDV3NWR","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"RXWEZ6Q7","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:c1c84b78d8ea069396253276e8a8d10f724eb533c992739e09534281915c1198","target":"graph","created_at":"2026-05-18T00:44:30Z","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":"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","authors_text":"Bo Deng, Haixing Zhao, Wenjing Li, Xueliang Li, Yaping Mao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-15T16:28:00Z","title":"Conflict-free connection numbers of line graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05317","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:b1eee7bc43b9ddc8d375683c0f16f983057d29408c82a75b11d78451c69fa91c","target":"record","created_at":"2026-05-18T00:44:30Z","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":"a43c704efef0f588c51058c029e449576501052978bdab057ed1dfe869bf8f95","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-15T16:28:00Z","title_canon_sha256":"d8595eea0398fb46694c6c5df5baa04cd100c1d399592b788f932a7430fe95fe"},"schema_version":"1.0","source":{"id":"1705.05317","kind":"arxiv","version":1}},"canonical_sha256":"8dec4cfa1f28875db6d10394292c75245f1eb7a8189aafb5a693265839247753","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8dec4cfa1f28875db6d10394292c75245f1eb7a8189aafb5a693265839247753","first_computed_at":"2026-05-18T00:44:30.835698Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:30.835698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LCehFvUN+XB+vU6drU08esid1cyqLH6CyzDIhqtcM5mIXnYyEmvOpvsPZ+f4twIRENmOBa9dG8PStnvkToi4DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:30.836219Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.05317","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b1eee7bc43b9ddc8d375683c0f16f983057d29408c82a75b11d78451c69fa91c","sha256:c1c84b78d8ea069396253276e8a8d10f724eb533c992739e09534281915c1198"],"state_sha256":"9a4cd68f41186293e494498b4dc70ac66719820c679b229ccdfe6dc6440a5c3b"}