{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:J2JYU2QSKIUVRGZHE3O6T4CZNF","short_pith_number":"pith:J2JYU2QS","schema_version":"1.0","canonical_sha256":"4e938a6a125229589b2726dde9f0596969b3caa7136d7e9db1388f3407d07192","source":{"kind":"arxiv","id":"1712.04524","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1712.04524","created_at":"2026-05-17T23:56:05.495274+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.04524v2","created_at":"2026-05-17T23:56:05.495274+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04524","created_at":"2026-05-17T23:56:05.495274+00:00"},{"alias_kind":"pith_short_12","alias_value":"J2JYU2QSKIUV","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"J2JYU2QSKIUVRGZH","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"J2JYU2QS","created_at":"2026-05-18T12:31:21.493067+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J2JYU2QSKIUVRGZHE3O6T4CZNF","json":"https://pith.science/pith/J2JYU2QSKIUVRGZHE3O6T4CZNF.json","graph_json":"https://pith.science/api/pith-number/J2JYU2QSKIUVRGZHE3O6T4CZNF/graph.json","events_json":"https://pith.science/api/pith-number/J2JYU2QSKIUVRGZHE3O6T4CZNF/events.json","paper":"https://pith.science/paper/J2JYU2QS"},"agent_actions":{"view_html":"https://pith.science/pith/J2JYU2QSKIUVRGZHE3O6T4CZNF","download_json":"https://pith.science/pith/J2JYU2QSKIUVRGZHE3O6T4CZNF.json","view_paper":"https://pith.science/paper/J2JYU2QS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.04524&json=true","fetch_graph":"https://pith.science/api/pith-number/J2JYU2QSKIUVRGZHE3O6T4CZNF/graph.json","fetch_events":"https://pith.science/api/pith-number/J2JYU2QSKIUVRGZHE3O6T4CZNF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J2JYU2QSKIUVRGZHE3O6T4CZNF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J2JYU2QSKIUVRGZHE3O6T4CZNF/action/storage_attestation","attest_author":"https://pith.science/pith/J2JYU2QSKIUVRGZHE3O6T4CZNF/action/author_attestation","sign_citation":"https://pith.science/pith/J2JYU2QSKIUVRGZHE3O6T4CZNF/action/citation_signature","submit_replication":"https://pith.science/pith/J2JYU2QSKIUVRGZHE3O6T4CZNF/action/replication_record"}},"created_at":"2026-05-17T23:56:05.495274+00:00","updated_at":"2026-05-17T23:56:05.495274+00:00"}