{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:T3H2LIER6PHSYH2CRSCUFXUKOH","short_pith_number":"pith:T3H2LIER","schema_version":"1.0","canonical_sha256":"9ecfa5a091f3cf2c1f428c8542de8a71ff26d454c5ab1a2094176acbc5ba6fb8","source":{"kind":"arxiv","id":"1701.05999","version":2},"attestation_state":"computed","paper":{"title":"Conflict-Free Coloring of Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Adam Hesterberg, Aman Gour, Christian Scheffer, Erik D. Demaine, Phillip Keldenich, S\\'andor P. Fekete, Victor Alvarez, Zachary Abel","submitted_at":"2017-01-21T09:06:00Z","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"},"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":"1701.05999","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-21T09:06:00Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"454b5f2268f706949b9d5fcd1a1cae32ec224a70010bd357504e3c35b51a89ed","abstract_canon_sha256":"90d65b24242c68818a221b10dcf9c992b40c70d3c039c3160ad34f0d0b6838f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:56.791563Z","signature_b64":"C5kYYD5fxnWgfZOWh/5LuyaCxU5C7aNj0L62+J27i1IZ3Aq9TtULw+1uPgB9CVRD9vEb0kwIfyW6XYYdkUPbBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ecfa5a091f3cf2c1f428c8542de8a71ff26d454c5ab1a2094176acbc5ba6fb8","last_reissued_at":"2026-05-18T00:05:56.791182Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:56.791182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Conflict-Free Coloring of Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Adam Hesterberg, Aman Gour, Christian Scheffer, Erik D. Demaine, Phillip Keldenich, S\\'andor P. Fekete, Victor Alvarez, Zachary Abel","submitted_at":"2017-01-21T09:06:00Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05999","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":"1701.05999","created_at":"2026-05-18T00:05:56.791241+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.05999v2","created_at":"2026-05-18T00:05:56.791241+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05999","created_at":"2026-05-18T00:05:56.791241+00:00"},{"alias_kind":"pith_short_12","alias_value":"T3H2LIER6PHS","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"T3H2LIER6PHSYH2C","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"T3H2LIER","created_at":"2026-05-18T12:31:43.269735+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/T3H2LIER6PHSYH2CRSCUFXUKOH","json":"https://pith.science/pith/T3H2LIER6PHSYH2CRSCUFXUKOH.json","graph_json":"https://pith.science/api/pith-number/T3H2LIER6PHSYH2CRSCUFXUKOH/graph.json","events_json":"https://pith.science/api/pith-number/T3H2LIER6PHSYH2CRSCUFXUKOH/events.json","paper":"https://pith.science/paper/T3H2LIER"},"agent_actions":{"view_html":"https://pith.science/pith/T3H2LIER6PHSYH2CRSCUFXUKOH","download_json":"https://pith.science/pith/T3H2LIER6PHSYH2CRSCUFXUKOH.json","view_paper":"https://pith.science/paper/T3H2LIER","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.05999&json=true","fetch_graph":"https://pith.science/api/pith-number/T3H2LIER6PHSYH2CRSCUFXUKOH/graph.json","fetch_events":"https://pith.science/api/pith-number/T3H2LIER6PHSYH2CRSCUFXUKOH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T3H2LIER6PHSYH2CRSCUFXUKOH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T3H2LIER6PHSYH2CRSCUFXUKOH/action/storage_attestation","attest_author":"https://pith.science/pith/T3H2LIER6PHSYH2CRSCUFXUKOH/action/author_attestation","sign_citation":"https://pith.science/pith/T3H2LIER6PHSYH2CRSCUFXUKOH/action/citation_signature","submit_replication":"https://pith.science/pith/T3H2LIER6PHSYH2CRSCUFXUKOH/action/replication_record"}},"created_at":"2026-05-18T00:05:56.791241+00:00","updated_at":"2026-05-18T00:05:56.791241+00:00"}