{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QY53LW4HZBDZSSLSXVGT4RKCSK","short_pith_number":"pith:QY53LW4H","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"},"canonical_sha256":"863bb5db87c847994972bd4d3e4542929deebe517c3cfc9b9f99ddac3174e026","source":{"kind":"arxiv","id":"1709.00001","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.00001","created_at":"2026-05-18T00:36:13Z"},{"alias_kind":"arxiv_version","alias_value":"1709.00001v1","created_at":"2026-05-18T00:36:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00001","created_at":"2026-05-18T00:36:13Z"},{"alias_kind":"pith_short_12","alias_value":"QY53LW4HZBDZ","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QY53LW4HZBDZSSLS","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QY53LW4H","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QY53LW4HZBDZSSLSXVGT4RKCSK","target":"record","payload":{"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"},"canonical_sha256":"863bb5db87c847994972bd4d3e4542929deebe517c3cfc9b9f99ddac3174e026","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"},"source_kind":"arxiv","source_id":"1709.00001","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:36:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M3wYEMPqhP5GNyacH1tizzo8xIH64eHGntJUQLBXmHDWMBip3pXaPDaA9em60Xwa70aijb46n/Ii8PSMa5FZAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:45:53.150802Z"},"content_sha256":"35655107637367afcc8c69964717699a5edd7b1cb40b3cd8015335d621613d61","schema_version":"1.0","event_id":"sha256:35655107637367afcc8c69964717699a5edd7b1cb40b3cd8015335d621613d61"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QY53LW4HZBDZSSLSXVGT4RKCSK","target":"graph","payload":{"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"},"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:36:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ACvTTEa+AXKgzgcB+OGwgT4nyX3sPRKQZwiHAil7CnfN208eCnyJTHbvI/aOVizqg/a+zrYOBjTh9vdk/g2JAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:45:53.151150Z"},"content_sha256":"e1f585ca5b42fba471fe6a8a1e25bec0457d8cbcf971ef2c17541e13d457abdc","schema_version":"1.0","event_id":"sha256:e1f585ca5b42fba471fe6a8a1e25bec0457d8cbcf971ef2c17541e13d457abdc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QY53LW4HZBDZSSLSXVGT4RKCSK/bundle.json","state_url":"https://pith.science/pith/QY53LW4HZBDZSSLSXVGT4RKCSK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QY53LW4HZBDZSSLSXVGT4RKCSK/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-06-04T03:45:53Z","links":{"resolver":"https://pith.science/pith/QY53LW4HZBDZSSLSXVGT4RKCSK","bundle":"https://pith.science/pith/QY53LW4HZBDZSSLSXVGT4RKCSK/bundle.json","state":"https://pith.science/pith/QY53LW4HZBDZSSLSXVGT4RKCSK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QY53LW4HZBDZSSLSXVGT4RKCSK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QY53LW4HZBDZSSLSXVGT4RKCSK","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":"e7d8d3a1aa0e7f3f921b03fb83806dd1d3d243f92414a84e16c054d434642e8e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-30T19:19:04Z","title_canon_sha256":"6430f236b882c86d67231b9d8b45d9a2bbf7f74bc6b7d108d84472dfbf2aaef3"},"schema_version":"1.0","source":{"id":"1709.00001","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.00001","created_at":"2026-05-18T00:36:13Z"},{"alias_kind":"arxiv_version","alias_value":"1709.00001v1","created_at":"2026-05-18T00:36:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00001","created_at":"2026-05-18T00:36:13Z"},{"alias_kind":"pith_short_12","alias_value":"QY53LW4HZBDZ","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QY53LW4HZBDZSSLS","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QY53LW4H","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:e1f585ca5b42fba471fe6a8a1e25bec0457d8cbcf971ef2c17541e13d457abdc","target":"graph","created_at":"2026-05-18T00:36:13Z","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":"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","authors_text":"Arthur van Goethem, Irina Kostitsyna, Jules Wulms, Marc van Kreveld, Max Sondag, Wouter Meulemans","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-30T19:19:04Z","title":"The Painter's Problem: covering a grid with colored connected polygons"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00001","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:35655107637367afcc8c69964717699a5edd7b1cb40b3cd8015335d621613d61","target":"record","created_at":"2026-05-18T00:36:13Z","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":"e7d8d3a1aa0e7f3f921b03fb83806dd1d3d243f92414a84e16c054d434642e8e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-30T19:19:04Z","title_canon_sha256":"6430f236b882c86d67231b9d8b45d9a2bbf7f74bc6b7d108d84472dfbf2aaef3"},"schema_version":"1.0","source":{"id":"1709.00001","kind":"arxiv","version":1}},"canonical_sha256":"863bb5db87c847994972bd4d3e4542929deebe517c3cfc9b9f99ddac3174e026","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"863bb5db87c847994972bd4d3e4542929deebe517c3cfc9b9f99ddac3174e026","first_computed_at":"2026-05-18T00:36:13.668608Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:13.668608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CiGd/nfYOZRwMBO9kfjF9fZFOCWEkrW4M+jORt3wMRsPmQxdQU5maDqZvC5IBqmnBavhhquFlYvA7PtOC6lrBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:13.669377Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.00001","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35655107637367afcc8c69964717699a5edd7b1cb40b3cd8015335d621613d61","sha256:e1f585ca5b42fba471fe6a8a1e25bec0457d8cbcf971ef2c17541e13d457abdc"],"state_sha256":"e4e2ce27eebe59230703a9456de5e82e8be9289d348fde946e46935da48e8680"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cHRaBdnBeHQIVoYUHlQZU/CXgN4USifhqmjbSTAZ2sDZubRFT9og9uBHTzmNRIpSSiPufANheWZMh4eflV4nBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T03:45:53.153108Z","bundle_sha256":"afdf5b94489213623ec150d533672c5f16fbce0c3f47c103a5059841a8764e9d"}}