{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WQJ7JYX56UTQPAMBWFTEFZJDVP","short_pith_number":"pith:WQJ7JYX5","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"},"canonical_sha256":"b413f4e2fdf527078181b16642e523abc961b9f68ad2b1f3668e1a13a90506ef","source":{"kind":"arxiv","id":"1805.08072","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08072","created_at":"2026-05-18T00:05:21Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08072v3","created_at":"2026-05-18T00:05:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08072","created_at":"2026-05-18T00:05:21Z"},{"alias_kind":"pith_short_12","alias_value":"WQJ7JYX56UTQ","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WQJ7JYX56UTQPAMB","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WQJ7JYX5","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WQJ7JYX56UTQPAMBWFTEFZJDVP","target":"record","payload":{"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"},"canonical_sha256":"b413f4e2fdf527078181b16642e523abc961b9f68ad2b1f3668e1a13a90506ef","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"},"source_kind":"arxiv","source_id":"1805.08072","source_version":3,"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:05:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"18wWbHNGIIyAE3x4vGD6+GSoWeSRB3bU7zhV6E0UpNtTROxAcgci/UlbI5xy7RX6M9AaRzS+VuOC6EOvoREaCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:00:10.029976Z"},"content_sha256":"0c2aa424e4e2be2eedf8713db9275560ebd565bf5e235011340aea2272db5e88","schema_version":"1.0","event_id":"sha256:0c2aa424e4e2be2eedf8713db9275560ebd565bf5e235011340aea2272db5e88"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WQJ7JYX56UTQPAMBWFTEFZJDVP","target":"graph","payload":{"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"},"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:05:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UX6r2W98epQawgLju/bu07tC5Sctp9ouu3rbS390x6MpNeL9LVjVMls13hM3FXnbLVR3oAP0vGetdFzl2N2GBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:00:10.030344Z"},"content_sha256":"8f2f59fc8e401bbdca487ef6481cdf8c6bbf53bed9a7286e3e845d912a5e1e11","schema_version":"1.0","event_id":"sha256:8f2f59fc8e401bbdca487ef6481cdf8c6bbf53bed9a7286e3e845d912a5e1e11"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WQJ7JYX56UTQPAMBWFTEFZJDVP/bundle.json","state_url":"https://pith.science/pith/WQJ7JYX56UTQPAMBWFTEFZJDVP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WQJ7JYX56UTQPAMBWFTEFZJDVP/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-01T19:00:10Z","links":{"resolver":"https://pith.science/pith/WQJ7JYX56UTQPAMBWFTEFZJDVP","bundle":"https://pith.science/pith/WQJ7JYX56UTQPAMBWFTEFZJDVP/bundle.json","state":"https://pith.science/pith/WQJ7JYX56UTQPAMBWFTEFZJDVP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WQJ7JYX56UTQPAMBWFTEFZJDVP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WQJ7JYX56UTQPAMBWFTEFZJDVP","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":"2b038342d551ccec5bc471ce0cfc8c2cc1b3bbfb48a9beac458a42370093d1b5","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-18T07:40:12Z","title_canon_sha256":"c2513be0454514fe6231e9217ace4218accb39bd7033685e14497f93fdc7b9f6"},"schema_version":"1.0","source":{"id":"1805.08072","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08072","created_at":"2026-05-18T00:05:21Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08072v3","created_at":"2026-05-18T00:05:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08072","created_at":"2026-05-18T00:05:21Z"},{"alias_kind":"pith_short_12","alias_value":"WQJ7JYX56UTQ","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WQJ7JYX56UTQPAMB","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WQJ7JYX5","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:8f2f59fc8e401bbdca487ef6481cdf8c6bbf53bed9a7286e3e845d912a5e1e11","target":"graph","created_at":"2026-05-18T00:05:21Z","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":"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","authors_text":"Meng Ji, Xiaoyu Zhu, Xueliang Li","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-18T07:40:12Z","title":"Conflict-free connections: algorithm and complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08072","kind":"arxiv","version":3},"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:0c2aa424e4e2be2eedf8713db9275560ebd565bf5e235011340aea2272db5e88","target":"record","created_at":"2026-05-18T00:05:21Z","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":"2b038342d551ccec5bc471ce0cfc8c2cc1b3bbfb48a9beac458a42370093d1b5","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-18T07:40:12Z","title_canon_sha256":"c2513be0454514fe6231e9217ace4218accb39bd7033685e14497f93fdc7b9f6"},"schema_version":"1.0","source":{"id":"1805.08072","kind":"arxiv","version":3}},"canonical_sha256":"b413f4e2fdf527078181b16642e523abc961b9f68ad2b1f3668e1a13a90506ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b413f4e2fdf527078181b16642e523abc961b9f68ad2b1f3668e1a13a90506ef","first_computed_at":"2026-05-18T00:05:21.627777Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:21.627777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Iq8snibeh8spNRr+3HXLBzDE/adO3ICvDv/+8ViTDyzpW0ydSGbGZcspsJYYLMlcRGoT7zRbRdsSKnXsrJlaCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:21.628220Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.08072","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c2aa424e4e2be2eedf8713db9275560ebd565bf5e235011340aea2272db5e88","sha256:8f2f59fc8e401bbdca487ef6481cdf8c6bbf53bed9a7286e3e845d912a5e1e11"],"state_sha256":"3533186e9a5aa93e5cd5502b5501a1bf19b861acf4dec6b236d1dbd9ff6cc148"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f6F1nY7DHkZyIKyzD4UtvaO3y9/ZtWf1B3JrSaqz6BK30y0QvbLY3l/byfqoZQoXq/oKF5SEhIHXhBvH8yNYDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:00:10.032328Z","bundle_sha256":"d8c51df0e3334cd515b40e1abe56cec7d937301fbbda8985fd8aea57d8c8fdd8"}}