{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LJBWHSBWQ55TDDODGNRDSBTWIM","short_pith_number":"pith:LJBWHSBW","schema_version":"1.0","canonical_sha256":"5a4363c836877b318dc3336239067643073571d6efad0f14ae1f29d3da2f3365","source":{"kind":"arxiv","id":"1704.02018","version":1},"attestation_state":"computed","paper":{"title":"Conflict-Free Coloring of Intersection Graphs of Geometric Objects","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chaya Keller, Shakhar Smorodinsky","submitted_at":"2017-04-06T20:43:40Z","abstract_excerpt":"In FOCS'2002, Even et al. introduced and studied the notion of conflict-free colorings of geometrically defined hypergraphs. They motivated it by frequency assignment problems in cellular networks. This notion has been extensively studied since then.\n  A conflict-free coloring of a graph is a coloring of its vertices such that the neighborhood (pointed or closed) of each vertex contains a vertex whose color differs from the colors of all other vertices in that neighborhood. In this paper we study conflict-colorings of intersection graphs of geometric objects. We show that any intersection grap"},"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":"1704.02018","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-06T20:43:40Z","cross_cats_sorted":[],"title_canon_sha256":"fe96c7afc6061d1f96c55c55d37af9c289c7fb72ddb7db3dacb92464244260a8","abstract_canon_sha256":"137f6c9d42602acb252ccc06e71a85d1f8e402ab98a3761c513b2ca500d51903"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:51.017293Z","signature_b64":"WdnV9LcGcPZYSZ9kU9cckmWc7DHcUlPlltgG9dRJQ5rgADd8ihLpJH/KbaLVTd5uYMBDf2p9u8pE9L9odestDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a4363c836877b318dc3336239067643073571d6efad0f14ae1f29d3da2f3365","last_reissued_at":"2026-05-18T00:46:51.016632Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:51.016632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Conflict-Free Coloring of Intersection Graphs of Geometric Objects","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chaya Keller, Shakhar Smorodinsky","submitted_at":"2017-04-06T20:43:40Z","abstract_excerpt":"In FOCS'2002, Even et al. introduced and studied the notion of conflict-free colorings of geometrically defined hypergraphs. They motivated it by frequency assignment problems in cellular networks. This notion has been extensively studied since then.\n  A conflict-free coloring of a graph is a coloring of its vertices such that the neighborhood (pointed or closed) of each vertex contains a vertex whose color differs from the colors of all other vertices in that neighborhood. In this paper we study conflict-colorings of intersection graphs of geometric objects. We show that any intersection grap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02018","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":"1704.02018","created_at":"2026-05-18T00:46:51.016733+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.02018v1","created_at":"2026-05-18T00:46:51.016733+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02018","created_at":"2026-05-18T00:46:51.016733+00:00"},{"alias_kind":"pith_short_12","alias_value":"LJBWHSBWQ55T","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LJBWHSBWQ55TDDOD","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LJBWHSBW","created_at":"2026-05-18T12:31:28.150371+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/LJBWHSBWQ55TDDODGNRDSBTWIM","json":"https://pith.science/pith/LJBWHSBWQ55TDDODGNRDSBTWIM.json","graph_json":"https://pith.science/api/pith-number/LJBWHSBWQ55TDDODGNRDSBTWIM/graph.json","events_json":"https://pith.science/api/pith-number/LJBWHSBWQ55TDDODGNRDSBTWIM/events.json","paper":"https://pith.science/paper/LJBWHSBW"},"agent_actions":{"view_html":"https://pith.science/pith/LJBWHSBWQ55TDDODGNRDSBTWIM","download_json":"https://pith.science/pith/LJBWHSBWQ55TDDODGNRDSBTWIM.json","view_paper":"https://pith.science/paper/LJBWHSBW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.02018&json=true","fetch_graph":"https://pith.science/api/pith-number/LJBWHSBWQ55TDDODGNRDSBTWIM/graph.json","fetch_events":"https://pith.science/api/pith-number/LJBWHSBWQ55TDDODGNRDSBTWIM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LJBWHSBWQ55TDDODGNRDSBTWIM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LJBWHSBWQ55TDDODGNRDSBTWIM/action/storage_attestation","attest_author":"https://pith.science/pith/LJBWHSBWQ55TDDODGNRDSBTWIM/action/author_attestation","sign_citation":"https://pith.science/pith/LJBWHSBWQ55TDDODGNRDSBTWIM/action/citation_signature","submit_replication":"https://pith.science/pith/LJBWHSBWQ55TDDODGNRDSBTWIM/action/replication_record"}},"created_at":"2026-05-18T00:46:51.016733+00:00","updated_at":"2026-05-18T00:46:51.016733+00:00"}