{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:LT4CDGNM4DBYPZ4LA2QBN7IAST","short_pith_number":"pith:LT4CDGNM","canonical_record":{"source":{"id":"1410.1372","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-10-03T13:43:54Z","cross_cats_sorted":[],"title_canon_sha256":"1c08e69df4f30fd466f0e3531a9845b21aaf8dd1eb6b064c09bf6f4a128a7471","abstract_canon_sha256":"64fd509b12ba3c261010a386e0e69aee33dfebac0333353ad5ce515282ddd4b8"},"schema_version":"1.0"},"canonical_sha256":"5cf82199ace0c387e78b06a016fd0094c0756ff92b890c684edb64cc651278b3","source":{"kind":"arxiv","id":"1410.1372","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.1372","created_at":"2026-05-18T01:16:37Z"},{"alias_kind":"arxiv_version","alias_value":"1410.1372v2","created_at":"2026-05-18T01:16:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.1372","created_at":"2026-05-18T01:16:37Z"},{"alias_kind":"pith_short_12","alias_value":"LT4CDGNM4DBY","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LT4CDGNM4DBYPZ4L","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LT4CDGNM","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:LT4CDGNM4DBYPZ4LA2QBN7IAST","target":"record","payload":{"canonical_record":{"source":{"id":"1410.1372","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-10-03T13:43:54Z","cross_cats_sorted":[],"title_canon_sha256":"1c08e69df4f30fd466f0e3531a9845b21aaf8dd1eb6b064c09bf6f4a128a7471","abstract_canon_sha256":"64fd509b12ba3c261010a386e0e69aee33dfebac0333353ad5ce515282ddd4b8"},"schema_version":"1.0"},"canonical_sha256":"5cf82199ace0c387e78b06a016fd0094c0756ff92b890c684edb64cc651278b3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:37.675632Z","signature_b64":"BlozcAqNM2FOd3aH3cYKtp6fNzVqIl9kPS/tIan81i+b/q3fmYQORDRqX57WGgmDYh4gaKU0IJzPMOzKT8xPAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5cf82199ace0c387e78b06a016fd0094c0756ff92b890c684edb64cc651278b3","last_reissued_at":"2026-05-18T01:16:37.674852Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:37.674852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.1372","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-18T01:16:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KdhoigSkGw3u+mtFS59WhMbhdBWcZgdtza4mhi+wm0C+9JfJXfagZ1YJg5NcH2012S+0I1yyajujOk3r1FRpCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:05:24.789784Z"},"content_sha256":"9879dc694701a72e1af5fc3826767c4ebc7e379bf62c76a386d6a9cdd5de4f6d","schema_version":"1.0","event_id":"sha256:9879dc694701a72e1af5fc3826767c4ebc7e379bf62c76a386d6a9cdd5de4f6d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:LT4CDGNM4DBYPZ4LA2QBN7IAST","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Two-Fold Circle-Covering of the Plane under Congruent Voronoi Polygon Conditions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"Jingchao Chen","submitted_at":"2014-10-03T13:43:54Z","abstract_excerpt":"The $k$-coverage problem is to find the minimum number of disks such that each point in a given plane is covered by at least $k$ disks. Under unit disk condition, when $k$=1, this problem has been solved by Kershner in 1939. However, when $k > 1$, it becomes extremely difficult. One tried to tackle this problem with different restrictions. In this paper, we restrict ourself to congruent Voronoi polygon, and prove the minimum density of the two-coverage with such a restriction. Our proof is simpler and more rigorous than that given recently by Yun et al."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.1372","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-18T01:16:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kdbFzw4PhyKq/KLHAAh7VlRPAg27c0v8GjFfne6RSAyktFIW01YR868A/zcBqHyLm+lZ3qn7rY7JGWWq51MsDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:05:24.790122Z"},"content_sha256":"56840b0614f66ebe24e7d239962d2448b019319ef315906087f17a2edb80f4dd","schema_version":"1.0","event_id":"sha256:56840b0614f66ebe24e7d239962d2448b019319ef315906087f17a2edb80f4dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LT4CDGNM4DBYPZ4LA2QBN7IAST/bundle.json","state_url":"https://pith.science/pith/LT4CDGNM4DBYPZ4LA2QBN7IAST/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LT4CDGNM4DBYPZ4LA2QBN7IAST/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-02T11:05:24Z","links":{"resolver":"https://pith.science/pith/LT4CDGNM4DBYPZ4LA2QBN7IAST","bundle":"https://pith.science/pith/LT4CDGNM4DBYPZ4LA2QBN7IAST/bundle.json","state":"https://pith.science/pith/LT4CDGNM4DBYPZ4LA2QBN7IAST/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LT4CDGNM4DBYPZ4LA2QBN7IAST/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:LT4CDGNM4DBYPZ4LA2QBN7IAST","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":"64fd509b12ba3c261010a386e0e69aee33dfebac0333353ad5ce515282ddd4b8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-10-03T13:43:54Z","title_canon_sha256":"1c08e69df4f30fd466f0e3531a9845b21aaf8dd1eb6b064c09bf6f4a128a7471"},"schema_version":"1.0","source":{"id":"1410.1372","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.1372","created_at":"2026-05-18T01:16:37Z"},{"alias_kind":"arxiv_version","alias_value":"1410.1372v2","created_at":"2026-05-18T01:16:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.1372","created_at":"2026-05-18T01:16:37Z"},{"alias_kind":"pith_short_12","alias_value":"LT4CDGNM4DBY","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LT4CDGNM4DBYPZ4L","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LT4CDGNM","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:56840b0614f66ebe24e7d239962d2448b019319ef315906087f17a2edb80f4dd","target":"graph","created_at":"2026-05-18T01:16:37Z","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":"The $k$-coverage problem is to find the minimum number of disks such that each point in a given plane is covered by at least $k$ disks. Under unit disk condition, when $k$=1, this problem has been solved by Kershner in 1939. However, when $k > 1$, it becomes extremely difficult. One tried to tackle this problem with different restrictions. In this paper, we restrict ourself to congruent Voronoi polygon, and prove the minimum density of the two-coverage with such a restriction. Our proof is simpler and more rigorous than that given recently by Yun et al.","authors_text":"Jingchao Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-10-03T13:43:54Z","title":"Two-Fold Circle-Covering of the Plane under Congruent Voronoi Polygon Conditions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.1372","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:9879dc694701a72e1af5fc3826767c4ebc7e379bf62c76a386d6a9cdd5de4f6d","target":"record","created_at":"2026-05-18T01:16:37Z","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":"64fd509b12ba3c261010a386e0e69aee33dfebac0333353ad5ce515282ddd4b8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-10-03T13:43:54Z","title_canon_sha256":"1c08e69df4f30fd466f0e3531a9845b21aaf8dd1eb6b064c09bf6f4a128a7471"},"schema_version":"1.0","source":{"id":"1410.1372","kind":"arxiv","version":2}},"canonical_sha256":"5cf82199ace0c387e78b06a016fd0094c0756ff92b890c684edb64cc651278b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5cf82199ace0c387e78b06a016fd0094c0756ff92b890c684edb64cc651278b3","first_computed_at":"2026-05-18T01:16:37.674852Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:37.674852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BlozcAqNM2FOd3aH3cYKtp6fNzVqIl9kPS/tIan81i+b/q3fmYQORDRqX57WGgmDYh4gaKU0IJzPMOzKT8xPAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:37.675632Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.1372","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9879dc694701a72e1af5fc3826767c4ebc7e379bf62c76a386d6a9cdd5de4f6d","sha256:56840b0614f66ebe24e7d239962d2448b019319ef315906087f17a2edb80f4dd"],"state_sha256":"b65588a4563d09ffe23593f46969ae0bb71e50cb3d03781b17cd342756ea30cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eO7l4+Ld19kWyn7DjAufB/tK2Sq8nVqSMSobIBmevk7MNRbraecGk5hI1Dwt0RRvTbE4beYGfKKb7AEFY3YyBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T11:05:24.792005Z","bundle_sha256":"bcabdd41f457207cbd6d28a924c603bd7116a9e2cfad0e4141c9f90cc5a3a48c"}}