{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:MVX4AL7BUFROGAKPOCJAZBIOP2","short_pith_number":"pith:MVX4AL7B","canonical_record":{"source":{"id":"1009.4641","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-23T15:45:05Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"b566a87a9104788287d193f610fab94f108a156d53e34f5f59cefb5869225962","abstract_canon_sha256":"9bd46422ee8c78dc64c8285fcc68ae83b6ffa50d5ea919b4cbddc5a3e15b7eff"},"schema_version":"1.0"},"canonical_sha256":"656fc02fe1a162e3014f70920c850e7eb70b3254c5a84fa98cbe621f6321672d","source":{"kind":"arxiv","id":"1009.4641","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.4641","created_at":"2026-05-18T04:40:21Z"},{"alias_kind":"arxiv_version","alias_value":"1009.4641v2","created_at":"2026-05-18T04:40:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4641","created_at":"2026-05-18T04:40:21Z"},{"alias_kind":"pith_short_12","alias_value":"MVX4AL7BUFRO","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"MVX4AL7BUFROGAKP","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"MVX4AL7B","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:MVX4AL7BUFROGAKPOCJAZBIOP2","target":"record","payload":{"canonical_record":{"source":{"id":"1009.4641","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-23T15:45:05Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"b566a87a9104788287d193f610fab94f108a156d53e34f5f59cefb5869225962","abstract_canon_sha256":"9bd46422ee8c78dc64c8285fcc68ae83b6ffa50d5ea919b4cbddc5a3e15b7eff"},"schema_version":"1.0"},"canonical_sha256":"656fc02fe1a162e3014f70920c850e7eb70b3254c5a84fa98cbe621f6321672d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:21.377089Z","signature_b64":"fEyEayS0MiK93+o9Dec8u7B8GKcpTAdjWCXC7U8KIXuE5ECywFyMWLe9pu6dKAR2cvlxupaB+s0XvWtCL20QDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"656fc02fe1a162e3014f70920c850e7eb70b3254c5a84fa98cbe621f6321672d","last_reissued_at":"2026-05-18T04:40:21.376588Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:21.376588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.4641","source_version":2,"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-18T04:40:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w7ntoF7btnIezUP2edVk2pegtcXyV296NEJwNdrwBk+P6NsyYfLlsc6c9SvDxXj+2jc9C+wlcyqwxynLtiWABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:02:59.154544Z"},"content_sha256":"a9034380ef41c912d8f6a509cffcfdc101fb0d154459ecf2a8376132b31b2186","schema_version":"1.0","event_id":"sha256:a9034380ef41c912d8f6a509cffcfdc101fb0d154459ecf2a8376132b31b2186"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:MVX4AL7BUFROGAKPOCJAZBIOP2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decomposition of Geometric Set Systems and Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"D\\\"om\\\"ot\\\"or P\\'alv\\\"olgyi","submitted_at":"2010-09-23T15:45:05Z","abstract_excerpt":"We study two decomposition problems in combinatorial geometry. The first part deals with the decomposition of multiple coverings of the plane. We say that a planar set is cover-decomposable if there is a constant m such that any m-fold covering of the plane with its translates is decomposable into two disjoint coverings of the whole plane. Pach conjectured that every convex set is cover-decomposable. We verify his conjecture for polygons. Moreover, if m is large enough, we prove that any m-fold covering can even be decomposed into k coverings. Then we show that the situation is exactly the opp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.4641","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"},"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-18T04:40:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BVoXBy3OEkTKteM608UBa/EIuGVfembyPsz9EogwIeqFanLTcG0uEu1Ui9mFNm5dJiPT/5F5cp0pZt60Ti7RBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:02:59.155191Z"},"content_sha256":"77847a2fe81233c4b8fdeab030740506a40f313f9170813b8c83ba6456508724","schema_version":"1.0","event_id":"sha256:77847a2fe81233c4b8fdeab030740506a40f313f9170813b8c83ba6456508724"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MVX4AL7BUFROGAKPOCJAZBIOP2/bundle.json","state_url":"https://pith.science/pith/MVX4AL7BUFROGAKPOCJAZBIOP2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MVX4AL7BUFROGAKPOCJAZBIOP2/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-31T15:02:59Z","links":{"resolver":"https://pith.science/pith/MVX4AL7BUFROGAKPOCJAZBIOP2","bundle":"https://pith.science/pith/MVX4AL7BUFROGAKPOCJAZBIOP2/bundle.json","state":"https://pith.science/pith/MVX4AL7BUFROGAKPOCJAZBIOP2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MVX4AL7BUFROGAKPOCJAZBIOP2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:MVX4AL7BUFROGAKPOCJAZBIOP2","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":"9bd46422ee8c78dc64c8285fcc68ae83b6ffa50d5ea919b4cbddc5a3e15b7eff","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-23T15:45:05Z","title_canon_sha256":"b566a87a9104788287d193f610fab94f108a156d53e34f5f59cefb5869225962"},"schema_version":"1.0","source":{"id":"1009.4641","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.4641","created_at":"2026-05-18T04:40:21Z"},{"alias_kind":"arxiv_version","alias_value":"1009.4641v2","created_at":"2026-05-18T04:40:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4641","created_at":"2026-05-18T04:40:21Z"},{"alias_kind":"pith_short_12","alias_value":"MVX4AL7BUFRO","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"MVX4AL7BUFROGAKP","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"MVX4AL7B","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:77847a2fe81233c4b8fdeab030740506a40f313f9170813b8c83ba6456508724","target":"graph","created_at":"2026-05-18T04:40:21Z","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":"We study two decomposition problems in combinatorial geometry. The first part deals with the decomposition of multiple coverings of the plane. We say that a planar set is cover-decomposable if there is a constant m such that any m-fold covering of the plane with its translates is decomposable into two disjoint coverings of the whole plane. Pach conjectured that every convex set is cover-decomposable. We verify his conjecture for polygons. Moreover, if m is large enough, we prove that any m-fold covering can even be decomposed into k coverings. Then we show that the situation is exactly the opp","authors_text":"D\\\"om\\\"ot\\\"or P\\'alv\\\"olgyi","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-23T15:45:05Z","title":"Decomposition of Geometric Set Systems and Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.4641","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:a9034380ef41c912d8f6a509cffcfdc101fb0d154459ecf2a8376132b31b2186","target":"record","created_at":"2026-05-18T04:40:21Z","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":"9bd46422ee8c78dc64c8285fcc68ae83b6ffa50d5ea919b4cbddc5a3e15b7eff","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-23T15:45:05Z","title_canon_sha256":"b566a87a9104788287d193f610fab94f108a156d53e34f5f59cefb5869225962"},"schema_version":"1.0","source":{"id":"1009.4641","kind":"arxiv","version":2}},"canonical_sha256":"656fc02fe1a162e3014f70920c850e7eb70b3254c5a84fa98cbe621f6321672d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"656fc02fe1a162e3014f70920c850e7eb70b3254c5a84fa98cbe621f6321672d","first_computed_at":"2026-05-18T04:40:21.376588Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:40:21.376588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fEyEayS0MiK93+o9Dec8u7B8GKcpTAdjWCXC7U8KIXuE5ECywFyMWLe9pu6dKAR2cvlxupaB+s0XvWtCL20QDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:40:21.377089Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.4641","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a9034380ef41c912d8f6a509cffcfdc101fb0d154459ecf2a8376132b31b2186","sha256:77847a2fe81233c4b8fdeab030740506a40f313f9170813b8c83ba6456508724"],"state_sha256":"511cbf91d8aa870d4eb25443a75ee576c15dbe0ce997d77f60ed25c34303a1a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0JMg7dY/F0LBBVeqM1yhIaKmcJXZ+ce0g2B6DB3U3DXQNvtEa64YKt22I/ILjZ7HKhsfImW1BO60hEunlFTLBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T15:02:59.157850Z","bundle_sha256":"179964126136da96288c1d11416729e722efc53c731b3b258e7b973c8c880d4b"}}