{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QC3SVWMUZPCNCA46HDA4F5KDO7","short_pith_number":"pith:QC3SVWMU","canonical_record":{"source":{"id":"1707.01634","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-06T04:47:26Z","cross_cats_sorted":[],"title_canon_sha256":"341c595a00aca8c38965b19bc31999e4c653da34329df148e2c17f01c8b8a59d","abstract_canon_sha256":"a797cd1e7e5fc06f25236feb868db28737f5af0e5cb043196c3afe7231203a3e"},"schema_version":"1.0"},"canonical_sha256":"80b72ad994cbc4d1039e38c1c2f54377cf33939fb2c9f2d82860082862231b61","source":{"kind":"arxiv","id":"1707.01634","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01634","created_at":"2026-05-18T00:16:36Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01634v2","created_at":"2026-05-18T00:16:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01634","created_at":"2026-05-18T00:16:36Z"},{"alias_kind":"pith_short_12","alias_value":"QC3SVWMUZPCN","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"QC3SVWMUZPCNCA46","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"QC3SVWMU","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QC3SVWMUZPCNCA46HDA4F5KDO7","target":"record","payload":{"canonical_record":{"source":{"id":"1707.01634","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-06T04:47:26Z","cross_cats_sorted":[],"title_canon_sha256":"341c595a00aca8c38965b19bc31999e4c653da34329df148e2c17f01c8b8a59d","abstract_canon_sha256":"a797cd1e7e5fc06f25236feb868db28737f5af0e5cb043196c3afe7231203a3e"},"schema_version":"1.0"},"canonical_sha256":"80b72ad994cbc4d1039e38c1c2f54377cf33939fb2c9f2d82860082862231b61","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:36.906113Z","signature_b64":"/lGFOuTqYGIN+9TJ6f6dfXUUK59npeS2GCgQXNTDXxlgVUdtKJpJrCpJxE09Gnr4dBVqRq3erxiK9a2vQ+rqAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80b72ad994cbc4d1039e38c1c2f54377cf33939fb2c9f2d82860082862231b61","last_reissued_at":"2026-05-18T00:16:36.905491Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:36.905491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.01634","source_version":2,"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:16:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cf0ApAn7RHq6EvcXygbAElSzJYIvqt/McvpnaNDLRuZaPC8dI9P2xxZ3b+QC/J2HvSEDfNkAVeIX4E57bRrlAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:55:12.902096Z"},"content_sha256":"4b9e5b5c0e2f4a2acbed7d1c7b27527c602023c9010af5b57e38ef35fb94ed93","schema_version":"1.0","event_id":"sha256:4b9e5b5c0e2f4a2acbed7d1c7b27527c602023c9010af5b57e38ef35fb94ed93"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QC3SVWMUZPCNCA46HDA4F5KDO7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graphs with conflict-free connection number two","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hong Chang, Ingo Schiermeyer, Stanislav Jendrol', Trung Duy Doan, Xueliang Li, Zhong Huang","submitted_at":"2017-07-06T04:47:26Z","abstract_excerpt":"An edge-colored graph $G$ is \\emph{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 \\emph{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. For a graph $G,$ let $C(G)$ be the subgraph of $G$ induced by its set of cut-edges. In this paper, we first show that, if $G$ is a connected non-complete graph $G$ of order $n\\geq 9$ with $C(G)$ being a linear forest and with the minimum degree %$\\delta(G"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01634","kind":"arxiv","version":2},"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:16:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E6AFjy2855fLxRhQw9gdjORZkOBzN/NbmefG/xf1p+2P0efMBaePsXRHseBUHWXRSgjHt5/dDgjgceTTW6eYCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:55:12.902458Z"},"content_sha256":"7e54e9f69b562a5620c4e648449357561a3247ee48d8e8e8b851509b9a1a5515","schema_version":"1.0","event_id":"sha256:7e54e9f69b562a5620c4e648449357561a3247ee48d8e8e8b851509b9a1a5515"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QC3SVWMUZPCNCA46HDA4F5KDO7/bundle.json","state_url":"https://pith.science/pith/QC3SVWMUZPCNCA46HDA4F5KDO7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QC3SVWMUZPCNCA46HDA4F5KDO7/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-01T15:55:12Z","links":{"resolver":"https://pith.science/pith/QC3SVWMUZPCNCA46HDA4F5KDO7","bundle":"https://pith.science/pith/QC3SVWMUZPCNCA46HDA4F5KDO7/bundle.json","state":"https://pith.science/pith/QC3SVWMUZPCNCA46HDA4F5KDO7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QC3SVWMUZPCNCA46HDA4F5KDO7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QC3SVWMUZPCNCA46HDA4F5KDO7","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":"a797cd1e7e5fc06f25236feb868db28737f5af0e5cb043196c3afe7231203a3e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-06T04:47:26Z","title_canon_sha256":"341c595a00aca8c38965b19bc31999e4c653da34329df148e2c17f01c8b8a59d"},"schema_version":"1.0","source":{"id":"1707.01634","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01634","created_at":"2026-05-18T00:16:36Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01634v2","created_at":"2026-05-18T00:16:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01634","created_at":"2026-05-18T00:16:36Z"},{"alias_kind":"pith_short_12","alias_value":"QC3SVWMUZPCN","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"QC3SVWMUZPCNCA46","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"QC3SVWMU","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:7e54e9f69b562a5620c4e648449357561a3247ee48d8e8e8b851509b9a1a5515","target":"graph","created_at":"2026-05-18T00:16:36Z","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 \\emph{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 \\emph{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. For a graph $G,$ let $C(G)$ be the subgraph of $G$ induced by its set of cut-edges. In this paper, we first show that, if $G$ is a connected non-complete graph $G$ of order $n\\geq 9$ with $C(G)$ being a linear forest and with the minimum degree %$\\delta(G","authors_text":"Hong Chang, Ingo Schiermeyer, Stanislav Jendrol', Trung Duy Doan, Xueliang Li, Zhong Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-06T04:47:26Z","title":"Graphs with conflict-free connection number two"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01634","kind":"arxiv","version":2},"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:4b9e5b5c0e2f4a2acbed7d1c7b27527c602023c9010af5b57e38ef35fb94ed93","target":"record","created_at":"2026-05-18T00:16:36Z","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":"a797cd1e7e5fc06f25236feb868db28737f5af0e5cb043196c3afe7231203a3e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-06T04:47:26Z","title_canon_sha256":"341c595a00aca8c38965b19bc31999e4c653da34329df148e2c17f01c8b8a59d"},"schema_version":"1.0","source":{"id":"1707.01634","kind":"arxiv","version":2}},"canonical_sha256":"80b72ad994cbc4d1039e38c1c2f54377cf33939fb2c9f2d82860082862231b61","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"80b72ad994cbc4d1039e38c1c2f54377cf33939fb2c9f2d82860082862231b61","first_computed_at":"2026-05-18T00:16:36.905491Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:36.905491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/lGFOuTqYGIN+9TJ6f6dfXUUK59npeS2GCgQXNTDXxlgVUdtKJpJrCpJxE09Gnr4dBVqRq3erxiK9a2vQ+rqAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:36.906113Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.01634","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b9e5b5c0e2f4a2acbed7d1c7b27527c602023c9010af5b57e38ef35fb94ed93","sha256:7e54e9f69b562a5620c4e648449357561a3247ee48d8e8e8b851509b9a1a5515"],"state_sha256":"43f2c0e723ef2ac708c0599cbbef7a3e75499df0db33cd11b03c6d3406f70636"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fvIOan1CLeKdSOP3tepOySIHZaFMKBH+dzpzrp3go4D48sqsqOiFt8d7YMegf32s7JZSPn+NhjXVndvcVZZ0Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T15:55:12.904382Z","bundle_sha256":"fd5ae265194b5d1d75893e4ad914adb3cecf109cc26e008d2ddbe03278fc0342"}}