{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QH4NAKLD4RNGFWGGPLGZ7QSINU","short_pith_number":"pith:QH4NAKLD","canonical_record":{"source":{"id":"1809.03582","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-10T20:29:04Z","cross_cats_sorted":[],"title_canon_sha256":"9bd7f6ac9574ec274e2ea0a7863763f4c43f3470c0cd972190a14464b060817d","abstract_canon_sha256":"4c4ed4e5ee2baf97674178fbff0742d051acc7a34090a2d73ce329c8d82b7ed0"},"schema_version":"1.0"},"canonical_sha256":"81f8d02963e45a62d8c67acd9fc2486d14b0780d1821d87cab6dfae472dd099d","source":{"kind":"arxiv","id":"1809.03582","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QH4NAKLD4RNGFWGGPLGZ7QSINU","target":"record","payload":{"canonical_record":{"source":{"id":"1809.03582","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-10T20:29:04Z","cross_cats_sorted":[],"title_canon_sha256":"9bd7f6ac9574ec274e2ea0a7863763f4c43f3470c0cd972190a14464b060817d","abstract_canon_sha256":"4c4ed4e5ee2baf97674178fbff0742d051acc7a34090a2d73ce329c8d82b7ed0"},"schema_version":"1.0"},"canonical_sha256":"81f8d02963e45a62d8c67acd9fc2486d14b0780d1821d87cab6dfae472dd099d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:00.406195Z","signature_b64":"krcnj4rtzK1MOFnzvyJlGhOgT2pIdLENil6oHML4uTUqL6aoRXkthuePoTDMepZUgDNCsT9uP8TOqhSNBsjpAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81f8d02963e45a62d8c67acd9fc2486d14b0780d1821d87cab6dfae472dd099d","last_reissued_at":"2026-05-18T00:06:00.405597Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:00.405597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.03582","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:06:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9DR8iFkhpC6E9hz4RwEOu1pxWyEMmhBkNVpMye4XEYGIx/rpInZHDmfuxp2pREzJlPEqiEUydr8LJxmG3gFFDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:33:06.230225Z"},"content_sha256":"577cb2909b92ce859db49774f545c49b7e189d5b06ef730d3c3e3af889f5b5ee","schema_version":"1.0","event_id":"sha256:577cb2909b92ce859db49774f545c49b7e189d5b06ef730d3c3e3af889f5b5ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QH4NAKLD4RNGFWGGPLGZ7QSINU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Conflict-free connection number of random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ran Gu, Xueliang Li","submitted_at":"2018-09-10T20:29:04Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.03582","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:06:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LZN7aGHloFh1uTZg1Fy8ZDrj5wj8khmzBRcNhw6MO+yhHnq2xLJt8P938kPi0P7E6dCD6gXus2h9HXfw6ac/BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:33:06.230597Z"},"content_sha256":"21746d7addaa6a458cb2174f546ae15f1ae8be8a93daf0ae70d196afad0ae87a","schema_version":"1.0","event_id":"sha256:21746d7addaa6a458cb2174f546ae15f1ae8be8a93daf0ae70d196afad0ae87a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QH4NAKLD4RNGFWGGPLGZ7QSINU/bundle.json","state_url":"https://pith.science/pith/QH4NAKLD4RNGFWGGPLGZ7QSINU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QH4NAKLD4RNGFWGGPLGZ7QSINU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T17:33:06Z","links":{"resolver":"https://pith.science/pith/QH4NAKLD4RNGFWGGPLGZ7QSINU","bundle":"https://pith.science/pith/QH4NAKLD4RNGFWGGPLGZ7QSINU/bundle.json","state":"https://pith.science/pith/QH4NAKLD4RNGFWGGPLGZ7QSINU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QH4NAKLD4RNGFWGGPLGZ7QSINU/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IUvtycObcIk6aBqBgf4e8N7OvHhkqwrkPn3UEdR2X9jv7elf7qTnnQ2G22UPB6id3BUt59CKLPXqwfWD7/wNAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T17:33:06.232798Z","bundle_sha256":"4693022a5b39309c9a4ec52535f7748e3b08dcd824dde581e0ceb67afd730960"}}