{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QH4NAKLD4RNGFWGGPLGZ7QSINU","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":"4c4ed4e5ee2baf97674178fbff0742d051acc7a34090a2d73ce329c8d82b7ed0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-10T20:29:04Z","title_canon_sha256":"9bd7f6ac9574ec274e2ea0a7863763f4c43f3470c0cd972190a14464b060817d"},"schema_version":"1.0","source":{"id":"1809.03582","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.03582","created_at":"2026-05-18T00:06:00Z"},{"alias_kind":"arxiv_version","alias_value":"1809.03582v1","created_at":"2026-05-18T00:06:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.03582","created_at":"2026-05-18T00:06:00Z"},{"alias_kind":"pith_short_12","alias_value":"QH4NAKLD4RNG","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QH4NAKLD4RNGFWGG","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QH4NAKLD","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:21746d7addaa6a458cb2174f546ae15f1ae8be8a93daf0ae70d196afad0ae87a","target":"graph","created_at":"2026-05-18T00:06:00Z","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":"An edge-colored graph $G$ is 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 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. In this paper, we show that almost all graphs have the conflict-free connection number 2. More precisely, let $G(n,p)$ denote the Erd\\H{o}s-R\\'{e}nyi random graph model, in which each of the $\\binom{n}{2}$ pairs of vertices appears as an edge with probability $p$ indepe","authors_text":"Ran Gu, Xueliang Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-10T20:29:04Z","title":"Conflict-free connection number of random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.03582","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:577cb2909b92ce859db49774f545c49b7e189d5b06ef730d3c3e3af889f5b5ee","target":"record","created_at":"2026-05-18T00:06:00Z","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":"4c4ed4e5ee2baf97674178fbff0742d051acc7a34090a2d73ce329c8d82b7ed0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-10T20:29:04Z","title_canon_sha256":"9bd7f6ac9574ec274e2ea0a7863763f4c43f3470c0cd972190a14464b060817d"},"schema_version":"1.0","source":{"id":"1809.03582","kind":"arxiv","version":1}},"canonical_sha256":"81f8d02963e45a62d8c67acd9fc2486d14b0780d1821d87cab6dfae472dd099d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"81f8d02963e45a62d8c67acd9fc2486d14b0780d1821d87cab6dfae472dd099d","first_computed_at":"2026-05-18T00:06:00.405597Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:00.405597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"krcnj4rtzK1MOFnzvyJlGhOgT2pIdLENil6oHML4uTUqL6aoRXkthuePoTDMepZUgDNCsT9uP8TOqhSNBsjpAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:00.406195Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.03582","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:577cb2909b92ce859db49774f545c49b7e189d5b06ef730d3c3e3af889f5b5ee","sha256:21746d7addaa6a458cb2174f546ae15f1ae8be8a93daf0ae70d196afad0ae87a"],"state_sha256":"83429ad6c9cdacfbf0ab8540d1aa3a1b332d6bc8f170aafcb3356db23f230b65"}