{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UQUPXUMISRR2EMTX6KIHIV5476","short_pith_number":"pith:UQUPXUMI","schema_version":"1.0","canonical_sha256":"a428fbd1889463a23277f2907457bcffa7bbf2d312d58e87bdc43bcfafeaee95","source":{"kind":"arxiv","id":"1709.03876","version":1},"attestation_state":"computed","paper":{"title":"Conflict-Free Coloring of Intersection Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Phillip Keldenich, S\\'andor P. Fekete","submitted_at":"2017-09-12T14:46:31Z","abstract_excerpt":"A conflict-free $k$-coloring of a graph $G=(V,E)$ assigns one of $k$ different colors to some of the vertices such that, for every vertex $v$, there is a color that is assigned to exactly one vertex among $v$ and $v$'s neighbors. Such colorings have applications in wireless networking, robotics, and geometry, and are well studied in graph theory. Here we study the conflict-free coloring of geometric intersection graphs. We demonstrate that the intersection graph of $n$ geometric objects without fatness properties and size restrictions may have conflict-free chromatic number in $\\Omega(\\log n/\\"},"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":"1709.03876","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-09-12T14:46:31Z","cross_cats_sorted":[],"title_canon_sha256":"0629283c5b8e4529327324f4745a27a728077dd0ffe9f04fbdd32e64c9193376","abstract_canon_sha256":"6c94617bcdd5117a7e2a3ef578bcc456a1e74f8869dfa0b15fd2cc776d1fca6b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:29.164604Z","signature_b64":"5ZCB7xVr6hKrajgLQrj/yJHRk9i4GBgQ7sZeoQAJVVaUwhlNegX5B7QH6OJwYiaK+Mbe1bc6YNqcp3cDDXCNCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a428fbd1889463a23277f2907457bcffa7bbf2d312d58e87bdc43bcfafeaee95","last_reissued_at":"2026-05-18T00:35:29.164040Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:29.164040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Conflict-Free Coloring of Intersection Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Phillip Keldenich, S\\'andor P. Fekete","submitted_at":"2017-09-12T14:46:31Z","abstract_excerpt":"A conflict-free $k$-coloring of a graph $G=(V,E)$ assigns one of $k$ different colors to some of the vertices such that, for every vertex $v$, there is a color that is assigned to exactly one vertex among $v$ and $v$'s neighbors. Such colorings have applications in wireless networking, robotics, and geometry, and are well studied in graph theory. Here we study the conflict-free coloring of geometric intersection graphs. We demonstrate that the intersection graph of $n$ geometric objects without fatness properties and size restrictions may have conflict-free chromatic number in $\\Omega(\\log n/\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03876","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1709.03876","created_at":"2026-05-18T00:35:29.164137+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.03876v1","created_at":"2026-05-18T00:35:29.164137+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03876","created_at":"2026-05-18T00:35:29.164137+00:00"},{"alias_kind":"pith_short_12","alias_value":"UQUPXUMISRR2","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"UQUPXUMISRR2EMTX","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"UQUPXUMI","created_at":"2026-05-18T12:31:49.984773+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/UQUPXUMISRR2EMTX6KIHIV5476","json":"https://pith.science/pith/UQUPXUMISRR2EMTX6KIHIV5476.json","graph_json":"https://pith.science/api/pith-number/UQUPXUMISRR2EMTX6KIHIV5476/graph.json","events_json":"https://pith.science/api/pith-number/UQUPXUMISRR2EMTX6KIHIV5476/events.json","paper":"https://pith.science/paper/UQUPXUMI"},"agent_actions":{"view_html":"https://pith.science/pith/UQUPXUMISRR2EMTX6KIHIV5476","download_json":"https://pith.science/pith/UQUPXUMISRR2EMTX6KIHIV5476.json","view_paper":"https://pith.science/paper/UQUPXUMI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.03876&json=true","fetch_graph":"https://pith.science/api/pith-number/UQUPXUMISRR2EMTX6KIHIV5476/graph.json","fetch_events":"https://pith.science/api/pith-number/UQUPXUMISRR2EMTX6KIHIV5476/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UQUPXUMISRR2EMTX6KIHIV5476/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UQUPXUMISRR2EMTX6KIHIV5476/action/storage_attestation","attest_author":"https://pith.science/pith/UQUPXUMISRR2EMTX6KIHIV5476/action/author_attestation","sign_citation":"https://pith.science/pith/UQUPXUMISRR2EMTX6KIHIV5476/action/citation_signature","submit_replication":"https://pith.science/pith/UQUPXUMISRR2EMTX6KIHIV5476/action/replication_record"}},"created_at":"2026-05-18T00:35:29.164137+00:00","updated_at":"2026-05-18T00:35:29.164137+00:00"}