{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TUCKGKP3SCIXVCVMJVGIBZIVMG","short_pith_number":"pith:TUCKGKP3","schema_version":"1.0","canonical_sha256":"9d04a329fb90917a8aac4d4c80e51561b3ae98984b77cbe7aa3d289cb644fa72","source":{"kind":"arxiv","id":"1901.08240","version":1},"attestation_state":"computed","paper":{"title":"Strong conflict-free connection of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Meng Ji, Xueliang Li","submitted_at":"2019-01-24T05:50:02Z","abstract_excerpt":"A path $P$ in an edge-colored graph is called \\emph{a conflict-free path} if there exists a color used on only one of the edges of $P$. An edge-colored graph $G$ is called \\emph{conflict-free connected} if for each pair of distinct vertices of $G$ there is a conflict-free path in $G$ connecting them. The graph $G$ is called \\emph{strongly conflict-free connected }if for every pair of vertices $u$ and $v$ of $G$ there exists a conflict-free path of length $d_G(u,v)$ in $G$ connecting them. For a connected graph $G$, the \\emph{strong conflict-free connection number} of $G$, denoted by $\\mathit{s"},"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":"1901.08240","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-24T05:50:02Z","cross_cats_sorted":[],"title_canon_sha256":"4213afb32358cf91641edae573f041d041827c1e000422e0af708fccb88025ac","abstract_canon_sha256":"02502d0030ebcb225b30dbc6563812f1ab6c39a4f2e793bc3d9a0199043eb47c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:37.580127Z","signature_b64":"/HI+HcIBxMcX4rNPjXPbIBsr6tcsoKq3MFOV3XDCLMC6hU9Aqc3tf9InQcuBovO4Jmyil9QHjicCd9GAQeIiDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d04a329fb90917a8aac4d4c80e51561b3ae98984b77cbe7aa3d289cb644fa72","last_reissued_at":"2026-05-17T23:55:37.579712Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:37.579712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong conflict-free connection of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Meng Ji, Xueliang Li","submitted_at":"2019-01-24T05:50:02Z","abstract_excerpt":"A path $P$ in an edge-colored graph is called \\emph{a conflict-free path} if there exists a color used on only one of the edges of $P$. An edge-colored graph $G$ is called \\emph{conflict-free connected} if for each pair of distinct vertices of $G$ there is a conflict-free path in $G$ connecting them. The graph $G$ is called \\emph{strongly conflict-free connected }if for every pair of vertices $u$ and $v$ of $G$ there exists a conflict-free path of length $d_G(u,v)$ in $G$ connecting them. For a connected graph $G$, the \\emph{strong conflict-free connection number} of $G$, denoted by $\\mathit{s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.08240","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":"1901.08240","created_at":"2026-05-17T23:55:37.579780+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.08240v1","created_at":"2026-05-17T23:55:37.579780+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.08240","created_at":"2026-05-17T23:55:37.579780+00:00"},{"alias_kind":"pith_short_12","alias_value":"TUCKGKP3SCIX","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"TUCKGKP3SCIXVCVM","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"TUCKGKP3","created_at":"2026-05-18T12:33:30.264802+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/TUCKGKP3SCIXVCVMJVGIBZIVMG","json":"https://pith.science/pith/TUCKGKP3SCIXVCVMJVGIBZIVMG.json","graph_json":"https://pith.science/api/pith-number/TUCKGKP3SCIXVCVMJVGIBZIVMG/graph.json","events_json":"https://pith.science/api/pith-number/TUCKGKP3SCIXVCVMJVGIBZIVMG/events.json","paper":"https://pith.science/paper/TUCKGKP3"},"agent_actions":{"view_html":"https://pith.science/pith/TUCKGKP3SCIXVCVMJVGIBZIVMG","download_json":"https://pith.science/pith/TUCKGKP3SCIXVCVMJVGIBZIVMG.json","view_paper":"https://pith.science/paper/TUCKGKP3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.08240&json=true","fetch_graph":"https://pith.science/api/pith-number/TUCKGKP3SCIXVCVMJVGIBZIVMG/graph.json","fetch_events":"https://pith.science/api/pith-number/TUCKGKP3SCIXVCVMJVGIBZIVMG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TUCKGKP3SCIXVCVMJVGIBZIVMG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TUCKGKP3SCIXVCVMJVGIBZIVMG/action/storage_attestation","attest_author":"https://pith.science/pith/TUCKGKP3SCIXVCVMJVGIBZIVMG/action/author_attestation","sign_citation":"https://pith.science/pith/TUCKGKP3SCIXVCVMJVGIBZIVMG/action/citation_signature","submit_replication":"https://pith.science/pith/TUCKGKP3SCIXVCVMJVGIBZIVMG/action/replication_record"}},"created_at":"2026-05-17T23:55:37.579780+00:00","updated_at":"2026-05-17T23:55:37.579780+00:00"}