{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WQJ7JYX56UTQPAMBWFTEFZJDVP","short_pith_number":"pith:WQJ7JYX5","schema_version":"1.0","canonical_sha256":"b413f4e2fdf527078181b16642e523abc961b9f68ad2b1f3668e1a13a90506ef","source":{"kind":"arxiv","id":"1805.08072","version":3},"attestation_state":"computed","paper":{"title":"Conflict-free connections: algorithm and complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"math.CO","authors_text":"Meng Ji, Xiaoyu Zhu, Xueliang Li","submitted_at":"2018-05-18T07:40:12Z","abstract_excerpt":"A path in an(a) edge(vertex)-colored graph is called \\emph{a conflict-free path} if there exists a color used on only one of its edges(vertices). An(A) edge(vertex)-colored graph is called \\emph{conflict-free (vertex-)connected} if there is a conflict-free path between each pair of distinct vertices. We call the graph $G$ \\emph{strongly conflict-free connected }if there exists a conflict-free path of length $d_G(u,v)$ for every two vertices $u,v\\in V(G)$. And the \\emph{strong conflict-free connection number} of a connected graph $G$, denoted by $scfc(G)$, is defined as the smallest number of c"},"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":"1805.08072","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-18T07:40:12Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"c2513be0454514fe6231e9217ace4218accb39bd7033685e14497f93fdc7b9f6","abstract_canon_sha256":"2b038342d551ccec5bc471ce0cfc8c2cc1b3bbfb48a9beac458a42370093d1b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:21.628220Z","signature_b64":"Iq8snibeh8spNRr+3HXLBzDE/adO3ICvDv/+8ViTDyzpW0ydSGbGZcspsJYYLMlcRGoT7zRbRdsSKnXsrJlaCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b413f4e2fdf527078181b16642e523abc961b9f68ad2b1f3668e1a13a90506ef","last_reissued_at":"2026-05-18T00:05:21.627777Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:21.627777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Conflict-free connections: algorithm and complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"math.CO","authors_text":"Meng Ji, Xiaoyu Zhu, Xueliang Li","submitted_at":"2018-05-18T07:40:12Z","abstract_excerpt":"A path in an(a) edge(vertex)-colored graph is called \\emph{a conflict-free path} if there exists a color used on only one of its edges(vertices). An(A) edge(vertex)-colored graph is called \\emph{conflict-free (vertex-)connected} if there is a conflict-free path between each pair of distinct vertices. We call the graph $G$ \\emph{strongly conflict-free connected }if there exists a conflict-free path of length $d_G(u,v)$ for every two vertices $u,v\\in V(G)$. And the \\emph{strong conflict-free connection number} of a connected graph $G$, denoted by $scfc(G)$, is defined as the smallest number of c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08072","kind":"arxiv","version":3},"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":"1805.08072","created_at":"2026-05-18T00:05:21.627843+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.08072v3","created_at":"2026-05-18T00:05:21.627843+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08072","created_at":"2026-05-18T00:05:21.627843+00:00"},{"alias_kind":"pith_short_12","alias_value":"WQJ7JYX56UTQ","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"WQJ7JYX56UTQPAMB","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"WQJ7JYX5","created_at":"2026-05-18T12:33:01.666342+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/WQJ7JYX56UTQPAMBWFTEFZJDVP","json":"https://pith.science/pith/WQJ7JYX56UTQPAMBWFTEFZJDVP.json","graph_json":"https://pith.science/api/pith-number/WQJ7JYX56UTQPAMBWFTEFZJDVP/graph.json","events_json":"https://pith.science/api/pith-number/WQJ7JYX56UTQPAMBWFTEFZJDVP/events.json","paper":"https://pith.science/paper/WQJ7JYX5"},"agent_actions":{"view_html":"https://pith.science/pith/WQJ7JYX56UTQPAMBWFTEFZJDVP","download_json":"https://pith.science/pith/WQJ7JYX56UTQPAMBWFTEFZJDVP.json","view_paper":"https://pith.science/paper/WQJ7JYX5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.08072&json=true","fetch_graph":"https://pith.science/api/pith-number/WQJ7JYX56UTQPAMBWFTEFZJDVP/graph.json","fetch_events":"https://pith.science/api/pith-number/WQJ7JYX56UTQPAMBWFTEFZJDVP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WQJ7JYX56UTQPAMBWFTEFZJDVP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WQJ7JYX56UTQPAMBWFTEFZJDVP/action/storage_attestation","attest_author":"https://pith.science/pith/WQJ7JYX56UTQPAMBWFTEFZJDVP/action/author_attestation","sign_citation":"https://pith.science/pith/WQJ7JYX56UTQPAMBWFTEFZJDVP/action/citation_signature","submit_replication":"https://pith.science/pith/WQJ7JYX56UTQPAMBWFTEFZJDVP/action/replication_record"}},"created_at":"2026-05-18T00:05:21.627843+00:00","updated_at":"2026-05-18T00:05:21.627843+00:00"}