{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UQUPXUMISRR2EMTX6KIHIV5476","short_pith_number":"pith:UQUPXUMI","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"},"canonical_sha256":"a428fbd1889463a23277f2907457bcffa7bbf2d312d58e87bdc43bcfafeaee95","source":{"kind":"arxiv","id":"1709.03876","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.03876","created_at":"2026-05-18T00:35:29Z"},{"alias_kind":"arxiv_version","alias_value":"1709.03876v1","created_at":"2026-05-18T00:35:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03876","created_at":"2026-05-18T00:35:29Z"},{"alias_kind":"pith_short_12","alias_value":"UQUPXUMISRR2","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"UQUPXUMISRR2EMTX","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"UQUPXUMI","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UQUPXUMISRR2EMTX6KIHIV5476","target":"record","payload":{"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"},"canonical_sha256":"a428fbd1889463a23277f2907457bcffa7bbf2d312d58e87bdc43bcfafeaee95","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"},"source_kind":"arxiv","source_id":"1709.03876","source_version":1,"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:35:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lcSQzgQ/+o6/aYuG7jkljgY+geOFkj/W9k1mLQDflBquSvqUQa11fbPmfRju4oDI0uhtfCj1uWSenTEEUDIdBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:56:34.180687Z"},"content_sha256":"68ca6197185a657a2fa372c9a8a860002d151021332fc382a5d22ef86940e053","schema_version":"1.0","event_id":"sha256:68ca6197185a657a2fa372c9a8a860002d151021332fc382a5d22ef86940e053"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UQUPXUMISRR2EMTX6KIHIV5476","target":"graph","payload":{"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"},"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:35:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hA0UTAoqWbhviQ3z2gY76o1hGMIoqHwHAyqFaiFpvyd32SybyAgihx/xf6mgcNfEV1sEB7XWjtdhQKmVt8LxAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:56:34.181504Z"},"content_sha256":"122c94542b1bd4acdbcdc293167e50f9ef8467328bbf349365f08b1d004b6e79","schema_version":"1.0","event_id":"sha256:122c94542b1bd4acdbcdc293167e50f9ef8467328bbf349365f08b1d004b6e79"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UQUPXUMISRR2EMTX6KIHIV5476/bundle.json","state_url":"https://pith.science/pith/UQUPXUMISRR2EMTX6KIHIV5476/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UQUPXUMISRR2EMTX6KIHIV5476/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-05-27T16:56:34Z","links":{"resolver":"https://pith.science/pith/UQUPXUMISRR2EMTX6KIHIV5476","bundle":"https://pith.science/pith/UQUPXUMISRR2EMTX6KIHIV5476/bundle.json","state":"https://pith.science/pith/UQUPXUMISRR2EMTX6KIHIV5476/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UQUPXUMISRR2EMTX6KIHIV5476/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UQUPXUMISRR2EMTX6KIHIV5476","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":"6c94617bcdd5117a7e2a3ef578bcc456a1e74f8869dfa0b15fd2cc776d1fca6b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-09-12T14:46:31Z","title_canon_sha256":"0629283c5b8e4529327324f4745a27a728077dd0ffe9f04fbdd32e64c9193376"},"schema_version":"1.0","source":{"id":"1709.03876","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.03876","created_at":"2026-05-18T00:35:29Z"},{"alias_kind":"arxiv_version","alias_value":"1709.03876v1","created_at":"2026-05-18T00:35:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03876","created_at":"2026-05-18T00:35:29Z"},{"alias_kind":"pith_short_12","alias_value":"UQUPXUMISRR2","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"UQUPXUMISRR2EMTX","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"UQUPXUMI","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:122c94542b1bd4acdbcdc293167e50f9ef8467328bbf349365f08b1d004b6e79","target":"graph","created_at":"2026-05-18T00:35:29Z","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 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/\\","authors_text":"Phillip Keldenich, S\\'andor P. Fekete","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-09-12T14:46:31Z","title":"Conflict-Free Coloring of Intersection Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03876","kind":"arxiv","version":1},"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:68ca6197185a657a2fa372c9a8a860002d151021332fc382a5d22ef86940e053","target":"record","created_at":"2026-05-18T00:35:29Z","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":"6c94617bcdd5117a7e2a3ef578bcc456a1e74f8869dfa0b15fd2cc776d1fca6b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-09-12T14:46:31Z","title_canon_sha256":"0629283c5b8e4529327324f4745a27a728077dd0ffe9f04fbdd32e64c9193376"},"schema_version":"1.0","source":{"id":"1709.03876","kind":"arxiv","version":1}},"canonical_sha256":"a428fbd1889463a23277f2907457bcffa7bbf2d312d58e87bdc43bcfafeaee95","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a428fbd1889463a23277f2907457bcffa7bbf2d312d58e87bdc43bcfafeaee95","first_computed_at":"2026-05-18T00:35:29.164040Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:29.164040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5ZCB7xVr6hKrajgLQrj/yJHRk9i4GBgQ7sZeoQAJVVaUwhlNegX5B7QH6OJwYiaK+Mbe1bc6YNqcp3cDDXCNCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:29.164604Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.03876","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68ca6197185a657a2fa372c9a8a860002d151021332fc382a5d22ef86940e053","sha256:122c94542b1bd4acdbcdc293167e50f9ef8467328bbf349365f08b1d004b6e79"],"state_sha256":"4da942a39531045e2bc722839f90d4d3fd089f1e1a5751e8c7fe99425d28b2fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CMoEIBD37EQ/bkF2NIh6HIqJElsI0jofhwtHhhJlZppxsSA9z5gdaJUJTuJirfTJwIykEW7LKPRD1qV6sqwfBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:56:34.186376Z","bundle_sha256":"1e7d47be9a0220fb7b0f9057faa44b9312d6db55aa5478162daa9fd8490abdb3"}}