{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:J2JYU2QSKIUVRGZHE3O6T4CZNF","short_pith_number":"pith:J2JYU2QS","canonical_record":{"source":{"id":"1712.04524","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-12T21:17:14Z","cross_cats_sorted":[],"title_canon_sha256":"9ecfb67b09b2152655fee8a6f992a87aed3226f068c4b367e120c67d0f64d7a6","abstract_canon_sha256":"7ee163c14cc7fb40ca2355bd74dd7fe12e8b4d3c9a283519743aa949a19bd343"},"schema_version":"1.0"},"canonical_sha256":"4e938a6a125229589b2726dde9f0596969b3caa7136d7e9db1388f3407d07192","source":{"kind":"arxiv","id":"1712.04524","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.04524","created_at":"2026-05-17T23:56:05Z"},{"alias_kind":"arxiv_version","alias_value":"1712.04524v2","created_at":"2026-05-17T23:56:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04524","created_at":"2026-05-17T23:56:05Z"},{"alias_kind":"pith_short_12","alias_value":"J2JYU2QSKIUV","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"J2JYU2QSKIUVRGZH","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"J2JYU2QS","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:J2JYU2QSKIUVRGZHE3O6T4CZNF","target":"record","payload":{"canonical_record":{"source":{"id":"1712.04524","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-12T21:17:14Z","cross_cats_sorted":[],"title_canon_sha256":"9ecfb67b09b2152655fee8a6f992a87aed3226f068c4b367e120c67d0f64d7a6","abstract_canon_sha256":"7ee163c14cc7fb40ca2355bd74dd7fe12e8b4d3c9a283519743aa949a19bd343"},"schema_version":"1.0"},"canonical_sha256":"4e938a6a125229589b2726dde9f0596969b3caa7136d7e9db1388f3407d07192","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:05.495856Z","signature_b64":"LWawIdle7FhzgRdKQiRFYE3xFJoB01w+KbDFD9bDqa3oZJ6n5XKXh3jQZKQ15Ppj1Pjq8by4FfLVfOH0qKp2Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e938a6a125229589b2726dde9f0596969b3caa7136d7e9db1388f3407d07192","last_reissued_at":"2026-05-17T23:56:05.495170Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:05.495170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.04524","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-17T23:56:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v4qvsMchpoVAut+I/uqHXQt/6S5nXF2fe0E9LLVEm7y56i1k3j82dUms6lF/AYc+3sgf6gl0JwagB3veKQNaBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:17:36.009535Z"},"content_sha256":"ce55678bb0c833f02a911ca283c96d2334fb6e266f440925072c0a7268076aeb","schema_version":"1.0","event_id":"sha256:ce55678bb0c833f02a911ca283c96d2334fb6e266f440925072c0a7268076aeb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:J2JYU2QSKIUVRGZHE3O6T4CZNF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Conflict-Free Coloring of String Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandre Rok, Chaya Keller, Shakhar Smorodinsky","submitted_at":"2017-12-12T21:17:14Z","abstract_excerpt":"Conflict-free coloring (in short, CF-coloring) of a graph $G = (V,E)$ is a coloring of $V$ such that the neighborhood of each vertex contains a vertex whose color differs from the color of any other vertex in that neighborhood. Bounds on CF-chromatic numbers have been studied both for general graphs and for intersection graphs of geometric shapes. In this paper we obtain such bounds for several classes of string graphs, i.e., intersection graphs of curves in the plane:\n  (i) We provide a general upper bound of $O(\\chi(G)^2 \\log n)$ on the CF-chromatic number of any string graph $G$ with $n$ ve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.04524","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-17T23:56:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p8GPY8L1mUu2tTbdSWZXMxZuCJEFQ0i6UvGlS87+C+uT7z7Is4KND+SkCfx48LWNJ64vEMDLY0l4zrg5Q89hCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:17:36.009886Z"},"content_sha256":"1d00a62ee5951ff5afa884086de9f009d92405490ee6ac9dd6a28308c495f46c","schema_version":"1.0","event_id":"sha256:1d00a62ee5951ff5afa884086de9f009d92405490ee6ac9dd6a28308c495f46c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J2JYU2QSKIUVRGZHE3O6T4CZNF/bundle.json","state_url":"https://pith.science/pith/J2JYU2QSKIUVRGZHE3O6T4CZNF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J2JYU2QSKIUVRGZHE3O6T4CZNF/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-05T11:17:36Z","links":{"resolver":"https://pith.science/pith/J2JYU2QSKIUVRGZHE3O6T4CZNF","bundle":"https://pith.science/pith/J2JYU2QSKIUVRGZHE3O6T4CZNF/bundle.json","state":"https://pith.science/pith/J2JYU2QSKIUVRGZHE3O6T4CZNF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J2JYU2QSKIUVRGZHE3O6T4CZNF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:J2JYU2QSKIUVRGZHE3O6T4CZNF","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":"7ee163c14cc7fb40ca2355bd74dd7fe12e8b4d3c9a283519743aa949a19bd343","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-12T21:17:14Z","title_canon_sha256":"9ecfb67b09b2152655fee8a6f992a87aed3226f068c4b367e120c67d0f64d7a6"},"schema_version":"1.0","source":{"id":"1712.04524","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.04524","created_at":"2026-05-17T23:56:05Z"},{"alias_kind":"arxiv_version","alias_value":"1712.04524v2","created_at":"2026-05-17T23:56:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04524","created_at":"2026-05-17T23:56:05Z"},{"alias_kind":"pith_short_12","alias_value":"J2JYU2QSKIUV","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"J2JYU2QSKIUVRGZH","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"J2JYU2QS","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:1d00a62ee5951ff5afa884086de9f009d92405490ee6ac9dd6a28308c495f46c","target":"graph","created_at":"2026-05-17T23:56:05Z","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":"Conflict-free coloring (in short, CF-coloring) of a graph $G = (V,E)$ is a coloring of $V$ such that the neighborhood of each vertex contains a vertex whose color differs from the color of any other vertex in that neighborhood. Bounds on CF-chromatic numbers have been studied both for general graphs and for intersection graphs of geometric shapes. In this paper we obtain such bounds for several classes of string graphs, i.e., intersection graphs of curves in the plane:\n  (i) We provide a general upper bound of $O(\\chi(G)^2 \\log n)$ on the CF-chromatic number of any string graph $G$ with $n$ ve","authors_text":"Alexandre Rok, Chaya Keller, Shakhar Smorodinsky","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-12T21:17:14Z","title":"Conflict-Free Coloring of String Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.04524","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:ce55678bb0c833f02a911ca283c96d2334fb6e266f440925072c0a7268076aeb","target":"record","created_at":"2026-05-17T23:56:05Z","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":"7ee163c14cc7fb40ca2355bd74dd7fe12e8b4d3c9a283519743aa949a19bd343","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-12T21:17:14Z","title_canon_sha256":"9ecfb67b09b2152655fee8a6f992a87aed3226f068c4b367e120c67d0f64d7a6"},"schema_version":"1.0","source":{"id":"1712.04524","kind":"arxiv","version":2}},"canonical_sha256":"4e938a6a125229589b2726dde9f0596969b3caa7136d7e9db1388f3407d07192","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e938a6a125229589b2726dde9f0596969b3caa7136d7e9db1388f3407d07192","first_computed_at":"2026-05-17T23:56:05.495170Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:05.495170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LWawIdle7FhzgRdKQiRFYE3xFJoB01w+KbDFD9bDqa3oZJ6n5XKXh3jQZKQ15Ppj1Pjq8by4FfLVfOH0qKp2Bg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:05.495856Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.04524","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce55678bb0c833f02a911ca283c96d2334fb6e266f440925072c0a7268076aeb","sha256:1d00a62ee5951ff5afa884086de9f009d92405490ee6ac9dd6a28308c495f46c"],"state_sha256":"e25f95b23854025a41d171927d8cd0001ae32412dc5bc4b826b2d8708c439df7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4PdvwwRk2LieHyMLsLs6QkxBCD1WQGXfoctGCXzORBvZ4nkRbUbdE5T1eRWTBEZqIAaEDtG0JsyS6FsfjVPIAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T11:17:36.011830Z","bundle_sha256":"54b022a03a13f6594e98a66602279f4116fc75f04a04bacf274df1f31236abb7"}}