{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QY53LW4HZBDZSSLSXVGT4RKCSK","short_pith_number":"pith:QY53LW4H","schema_version":"1.0","canonical_sha256":"863bb5db87c847994972bd4d3e4542929deebe517c3cfc9b9f99ddac3174e026","source":{"kind":"arxiv","id":"1709.00001","version":1},"attestation_state":"computed","paper":{"title":"The Painter's Problem: covering a grid with colored connected polygons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CG","authors_text":"Arthur van Goethem, Irina Kostitsyna, Jules Wulms, Marc van Kreveld, Max Sondag, Wouter Meulemans","submitted_at":"2017-08-30T19:19:04Z","abstract_excerpt":"Motivated by a new way of visualizing hypergraphs, we study the following problem. Consider a rectangular grid and a set of colors $\\chi$. Each cell $s$ in the grid is assigned a subset of colors $\\chi_s \\subseteq \\chi$ and should be partitioned such that for each color $c\\in \\chi_s$ at least one piece in the cell is identified with $c$. Cells assigned the empty color set remain white. We focus on the case where $\\chi = \\{\\text{red},\\text{blue}\\}$. Is it possible to partition each cell in the grid such that the unions of the resulting red and blue pieces form two connected polygons? We analyze"},"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.00001","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-30T19:19:04Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"6430f236b882c86d67231b9d8b45d9a2bbf7f74bc6b7d108d84472dfbf2aaef3","abstract_canon_sha256":"e7d8d3a1aa0e7f3f921b03fb83806dd1d3d243f92414a84e16c054d434642e8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:13.669377Z","signature_b64":"CiGd/nfYOZRwMBO9kfjF9fZFOCWEkrW4M+jORt3wMRsPmQxdQU5maDqZvC5IBqmnBavhhquFlYvA7PtOC6lrBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"863bb5db87c847994972bd4d3e4542929deebe517c3cfc9b9f99ddac3174e026","last_reissued_at":"2026-05-18T00:36:13.668608Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:13.668608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Painter's Problem: covering a grid with colored connected polygons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CG","authors_text":"Arthur van Goethem, Irina Kostitsyna, Jules Wulms, Marc van Kreveld, Max Sondag, Wouter Meulemans","submitted_at":"2017-08-30T19:19:04Z","abstract_excerpt":"Motivated by a new way of visualizing hypergraphs, we study the following problem. Consider a rectangular grid and a set of colors $\\chi$. Each cell $s$ in the grid is assigned a subset of colors $\\chi_s \\subseteq \\chi$ and should be partitioned such that for each color $c\\in \\chi_s$ at least one piece in the cell is identified with $c$. Cells assigned the empty color set remain white. We focus on the case where $\\chi = \\{\\text{red},\\text{blue}\\}$. Is it possible to partition each cell in the grid such that the unions of the resulting red and blue pieces form two connected polygons? We analyze"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00001","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.00001","created_at":"2026-05-18T00:36:13.668732+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.00001v1","created_at":"2026-05-18T00:36:13.668732+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00001","created_at":"2026-05-18T00:36:13.668732+00:00"},{"alias_kind":"pith_short_12","alias_value":"QY53LW4HZBDZ","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"QY53LW4HZBDZSSLS","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"QY53LW4H","created_at":"2026-05-18T12:31:39.905425+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/QY53LW4HZBDZSSLSXVGT4RKCSK","json":"https://pith.science/pith/QY53LW4HZBDZSSLSXVGT4RKCSK.json","graph_json":"https://pith.science/api/pith-number/QY53LW4HZBDZSSLSXVGT4RKCSK/graph.json","events_json":"https://pith.science/api/pith-number/QY53LW4HZBDZSSLSXVGT4RKCSK/events.json","paper":"https://pith.science/paper/QY53LW4H"},"agent_actions":{"view_html":"https://pith.science/pith/QY53LW4HZBDZSSLSXVGT4RKCSK","download_json":"https://pith.science/pith/QY53LW4HZBDZSSLSXVGT4RKCSK.json","view_paper":"https://pith.science/paper/QY53LW4H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.00001&json=true","fetch_graph":"https://pith.science/api/pith-number/QY53LW4HZBDZSSLSXVGT4RKCSK/graph.json","fetch_events":"https://pith.science/api/pith-number/QY53LW4HZBDZSSLSXVGT4RKCSK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QY53LW4HZBDZSSLSXVGT4RKCSK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QY53LW4HZBDZSSLSXVGT4RKCSK/action/storage_attestation","attest_author":"https://pith.science/pith/QY53LW4HZBDZSSLSXVGT4RKCSK/action/author_attestation","sign_citation":"https://pith.science/pith/QY53LW4HZBDZSSLSXVGT4RKCSK/action/citation_signature","submit_replication":"https://pith.science/pith/QY53LW4HZBDZSSLSXVGT4RKCSK/action/replication_record"}},"created_at":"2026-05-18T00:36:13.668732+00:00","updated_at":"2026-05-18T00:36:13.668732+00:00"}