{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:T3H2LIER6PHSYH2CRSCUFXUKOH","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":"90d65b24242c68818a221b10dcf9c992b40c70d3c039c3160ad34f0d0b6838f8","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-21T09:06:00Z","title_canon_sha256":"454b5f2268f706949b9d5fcd1a1cae32ec224a70010bd357504e3c35b51a89ed"},"schema_version":"1.0","source":{"id":"1701.05999","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05999","created_at":"2026-05-18T00:05:56Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05999v2","created_at":"2026-05-18T00:05:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05999","created_at":"2026-05-18T00:05:56Z"},{"alias_kind":"pith_short_12","alias_value":"T3H2LIER6PHS","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"T3H2LIER6PHSYH2C","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"T3H2LIER","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:15dfbbf1f2105472ad0825afc2d01f18f829bdf182a3be1b472f87245a127e57","target":"graph","created_at":"2026-05-18T00:05:56Z","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 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 natural problem of the conflict-free chromatic number chi_CF(G) (the smallest k for which conflict-free k-colorings exist). We provide results both for closed neighborhoods N[v], for which a vertex v is a member of its neighborhood, and for open neighbo","authors_text":"Adam Hesterberg, Aman Gour, Christian Scheffer, Erik D. Demaine, Phillip Keldenich, S\\'andor P. Fekete, Victor Alvarez, Zachary Abel","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-21T09:06:00Z","title":"Conflict-Free Coloring of Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05999","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:491224af99e4c578e8e4cb27eb98626b00eac70de91b38f6fbff486de4b3be7c","target":"record","created_at":"2026-05-18T00:05:56Z","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":"90d65b24242c68818a221b10dcf9c992b40c70d3c039c3160ad34f0d0b6838f8","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-21T09:06:00Z","title_canon_sha256":"454b5f2268f706949b9d5fcd1a1cae32ec224a70010bd357504e3c35b51a89ed"},"schema_version":"1.0","source":{"id":"1701.05999","kind":"arxiv","version":2}},"canonical_sha256":"9ecfa5a091f3cf2c1f428c8542de8a71ff26d454c5ab1a2094176acbc5ba6fb8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ecfa5a091f3cf2c1f428c8542de8a71ff26d454c5ab1a2094176acbc5ba6fb8","first_computed_at":"2026-05-18T00:05:56.791182Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:56.791182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C5kYYD5fxnWgfZOWh/5LuyaCxU5C7aNj0L62+J27i1IZ3Aq9TtULw+1uPgB9CVRD9vEb0kwIfyW6XYYdkUPbBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:56.791563Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.05999","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:491224af99e4c578e8e4cb27eb98626b00eac70de91b38f6fbff486de4b3be7c","sha256:15dfbbf1f2105472ad0825afc2d01f18f829bdf182a3be1b472f87245a127e57"],"state_sha256":"7d8ac86062c8ffbde61bbee4e72c5da5eeb24cfd41e39607ee7cca550d0bacaf"}