{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:DJSYBHQE2Z77I7C2JAMXKHE7Y6","short_pith_number":"pith:DJSYBHQE","canonical_record":{"source":{"id":"1403.2653","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-03-09T21:04:56Z","cross_cats_sorted":["cs.CG","math.CO"],"title_canon_sha256":"367efd0e11fa8a391f2686f70bc8aa2f619f9004f1d4505f2c80267e7abd88df","abstract_canon_sha256":"c21e95168d76d01328f2bac4d2c2dd16c76f26531c3ed6255aa3b80aebd365ff"},"schema_version":"1.0"},"canonical_sha256":"1a65809e04d67ff47c5a4819751c9fc7aca1c22b09994faf2b0cd524e5e48b0e","source":{"kind":"arxiv","id":"1403.2653","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.2653","created_at":"2026-05-18T02:56:42Z"},{"alias_kind":"arxiv_version","alias_value":"1403.2653v1","created_at":"2026-05-18T02:56:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.2653","created_at":"2026-05-18T02:56:42Z"},{"alias_kind":"pith_short_12","alias_value":"DJSYBHQE2Z77","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DJSYBHQE2Z77I7C2","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DJSYBHQE","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:DJSYBHQE2Z77I7C2JAMXKHE7Y6","target":"record","payload":{"canonical_record":{"source":{"id":"1403.2653","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-03-09T21:04:56Z","cross_cats_sorted":["cs.CG","math.CO"],"title_canon_sha256":"367efd0e11fa8a391f2686f70bc8aa2f619f9004f1d4505f2c80267e7abd88df","abstract_canon_sha256":"c21e95168d76d01328f2bac4d2c2dd16c76f26531c3ed6255aa3b80aebd365ff"},"schema_version":"1.0"},"canonical_sha256":"1a65809e04d67ff47c5a4819751c9fc7aca1c22b09994faf2b0cd524e5e48b0e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:42.872954Z","signature_b64":"wbJPJPBi1jvUwW0+6KzO+aQdYwYSgNTYD1kTpeCKFk6h2zSLB+jeiz/Lq+7RHb6Js9Gu+1whHzsE6pj6uvV5Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a65809e04d67ff47c5a4819751c9fc7aca1c22b09994faf2b0cd524e5e48b0e","last_reissued_at":"2026-05-18T02:56:42.872564Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:42.872564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.2653","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-18T02:56:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m3zbwhjOgNYNNxhPhoG/EghkTQVi58H4bTVNRNMGvnCY8MNewpg8NKgEgWriWxF2X3Jm6+WR1WCjDJy2r9ixAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:15:44.213971Z"},"content_sha256":"87edaa0313bb40b30254e57c1d08f7df7b5628ad34597c9c7bb50758b1b7437d","schema_version":"1.0","event_id":"sha256:87edaa0313bb40b30254e57c1d08f7df7b5628ad34597c9c7bb50758b1b7437d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:DJSYBHQE2Z77I7C2JAMXKHE7Y6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiple coverings with closed polygons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.CO"],"primary_cat":"math.MG","authors_text":"G\\'eza T\\'oth, Istv\\'an Kov\\'acs","submitted_at":"2014-03-09T21:04:56Z","abstract_excerpt":"A planar set $P$ is said to be cover-decomposable if there is a constant $k=k(P)$ such that every $k$-fold covering of the plane with translates of $P$ can be decomposed into two coverings. It is known that open convex polygons are cover-decomposable. Here we show that closed, centrally symmetric convex polygons are also cover-decomposable. We also show that an infinite-fold covering of the plane with translates of $P$ can be decomposed into two infinite-fold coverings. Both results hold for coverings of any subset of the plane."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.2653","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-18T02:56:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XtYNa1QG40VMt8efrCKUS1K+gfO2aepshNqNEEK6FUruYdL8s2SonV1uUJnrAL2vH9SYAFuxpBoEmANnx3pEAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:15:44.214695Z"},"content_sha256":"cb62b5fd58e0e93f79a7ad24dc43612734ed06bb437c254b60d1a6fe060f2f4a","schema_version":"1.0","event_id":"sha256:cb62b5fd58e0e93f79a7ad24dc43612734ed06bb437c254b60d1a6fe060f2f4a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DJSYBHQE2Z77I7C2JAMXKHE7Y6/bundle.json","state_url":"https://pith.science/pith/DJSYBHQE2Z77I7C2JAMXKHE7Y6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DJSYBHQE2Z77I7C2JAMXKHE7Y6/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-26T06:15:44Z","links":{"resolver":"https://pith.science/pith/DJSYBHQE2Z77I7C2JAMXKHE7Y6","bundle":"https://pith.science/pith/DJSYBHQE2Z77I7C2JAMXKHE7Y6/bundle.json","state":"https://pith.science/pith/DJSYBHQE2Z77I7C2JAMXKHE7Y6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DJSYBHQE2Z77I7C2JAMXKHE7Y6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:DJSYBHQE2Z77I7C2JAMXKHE7Y6","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":"c21e95168d76d01328f2bac4d2c2dd16c76f26531c3ed6255aa3b80aebd365ff","cross_cats_sorted":["cs.CG","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-03-09T21:04:56Z","title_canon_sha256":"367efd0e11fa8a391f2686f70bc8aa2f619f9004f1d4505f2c80267e7abd88df"},"schema_version":"1.0","source":{"id":"1403.2653","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.2653","created_at":"2026-05-18T02:56:42Z"},{"alias_kind":"arxiv_version","alias_value":"1403.2653v1","created_at":"2026-05-18T02:56:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.2653","created_at":"2026-05-18T02:56:42Z"},{"alias_kind":"pith_short_12","alias_value":"DJSYBHQE2Z77","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DJSYBHQE2Z77I7C2","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DJSYBHQE","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:cb62b5fd58e0e93f79a7ad24dc43612734ed06bb437c254b60d1a6fe060f2f4a","target":"graph","created_at":"2026-05-18T02:56:42Z","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 planar set $P$ is said to be cover-decomposable if there is a constant $k=k(P)$ such that every $k$-fold covering of the plane with translates of $P$ can be decomposed into two coverings. It is known that open convex polygons are cover-decomposable. Here we show that closed, centrally symmetric convex polygons are also cover-decomposable. We also show that an infinite-fold covering of the plane with translates of $P$ can be decomposed into two infinite-fold coverings. Both results hold for coverings of any subset of the plane.","authors_text":"G\\'eza T\\'oth, Istv\\'an Kov\\'acs","cross_cats":["cs.CG","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-03-09T21:04:56Z","title":"Multiple coverings with closed polygons"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.2653","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:87edaa0313bb40b30254e57c1d08f7df7b5628ad34597c9c7bb50758b1b7437d","target":"record","created_at":"2026-05-18T02:56:42Z","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":"c21e95168d76d01328f2bac4d2c2dd16c76f26531c3ed6255aa3b80aebd365ff","cross_cats_sorted":["cs.CG","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-03-09T21:04:56Z","title_canon_sha256":"367efd0e11fa8a391f2686f70bc8aa2f619f9004f1d4505f2c80267e7abd88df"},"schema_version":"1.0","source":{"id":"1403.2653","kind":"arxiv","version":1}},"canonical_sha256":"1a65809e04d67ff47c5a4819751c9fc7aca1c22b09994faf2b0cd524e5e48b0e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1a65809e04d67ff47c5a4819751c9fc7aca1c22b09994faf2b0cd524e5e48b0e","first_computed_at":"2026-05-18T02:56:42.872564Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:56:42.872564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wbJPJPBi1jvUwW0+6KzO+aQdYwYSgNTYD1kTpeCKFk6h2zSLB+jeiz/Lq+7RHb6Js9Gu+1whHzsE6pj6uvV5Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:56:42.872954Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.2653","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87edaa0313bb40b30254e57c1d08f7df7b5628ad34597c9c7bb50758b1b7437d","sha256:cb62b5fd58e0e93f79a7ad24dc43612734ed06bb437c254b60d1a6fe060f2f4a"],"state_sha256":"2b56085424619f81cae7eaffd1a374397fab446b12bfec25c31ba0af6c845bd7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cdv7oioFIouNyB2Jy25h4rScye5JZXR1FVCDoF0/1EB26YNcm0vNnmBzR2KqfCF17cqk7h4nCOa5U6i/QSvoCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T06:15:44.218559Z","bundle_sha256":"91090834a222fb208cfdfd2f988b0510127cf3dee87aa71d153b824a89317611"}}