{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:W6EBWNXPEENTZGLLNECVJ4GTXZ","short_pith_number":"pith:W6EBWNXP","canonical_record":{"source":{"id":"1406.3838","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-06-15T18:32:43Z","cross_cats_sorted":[],"title_canon_sha256":"970f6222e51c6a2227cfd052e06f0487a41104b7883b07d5f5ac0e8f59cad2db","abstract_canon_sha256":"13e8e95b043adf02b1324e38b3e6bcab3e5b699518fcad91e18e1876e249e5a5"},"schema_version":"1.0"},"canonical_sha256":"b7881b36ef211b3c996b690554f0d3be50b0248d4a53f0032b500711f1da66aa","source":{"kind":"arxiv","id":"1406.3838","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.3838","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"arxiv_version","alias_value":"1406.3838v1","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3838","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"pith_short_12","alias_value":"W6EBWNXPEENT","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"W6EBWNXPEENTZGLL","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"W6EBWNXP","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:W6EBWNXPEENTZGLLNECVJ4GTXZ","target":"record","payload":{"canonical_record":{"source":{"id":"1406.3838","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-06-15T18:32:43Z","cross_cats_sorted":[],"title_canon_sha256":"970f6222e51c6a2227cfd052e06f0487a41104b7883b07d5f5ac0e8f59cad2db","abstract_canon_sha256":"13e8e95b043adf02b1324e38b3e6bcab3e5b699518fcad91e18e1876e249e5a5"},"schema_version":"1.0"},"canonical_sha256":"b7881b36ef211b3c996b690554f0d3be50b0248d4a53f0032b500711f1da66aa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:39.644293Z","signature_b64":"+ebXeRHlXn0wBr6qFfW8XG3d3hV+SG1wfo1vvdudi6Z0LOFb60Aq+yotDH6vLn0A/QrSYOK5A8XObWP5gSilCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7881b36ef211b3c996b690554f0d3be50b0248d4a53f0032b500711f1da66aa","last_reissued_at":"2026-05-18T02:49:39.643969Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:39.643969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.3838","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:49:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Z08HGQLPwBUegZNhE+0hjTy1t/SbzkSg3m0/jh3tCgXaP5CEMy7Py9+EnVRtfM9VENJQFzO+GIMY37/AZlvBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:52:12.359765Z"},"content_sha256":"628415f8dc7d14d26594b4340a06dc1d75fc851effd8a79f1e45935cf66758a8","schema_version":"1.0","event_id":"sha256:628415f8dc7d14d26594b4340a06dc1d75fc851effd8a79f1e45935cf66758a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:W6EBWNXPEENTZGLLNECVJ4GTXZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A fast 25/6-approximation for the minimum unit disk cover problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Daniel Lu, Paul Liu","submitted_at":"2014-06-15T18:32:43Z","abstract_excerpt":"Given a point set P in 2D, the problem of finding the smallest set of unit disks that cover all of P is NP-hard. We present a simple algorithm for this problem with an approximation factor of 25/6 in the Euclidean norm and 2 in the max norm, by restricting the disk centers to lie on parallel lines. The run time and space of this algorithm is O(n log n) and O(n) respectively. This algorithm extends to any Lp norm and is asymptotically faster than known alternative approximation algorithms for the same approximation factor."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3838","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:49:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CS3aYDWKnZ0SouiNO7Vjx3vZ/gkWe2Ea+r269X32vq0jR3HhbYoleIljMFRD4Tw8cO/wDj5mrRQUYpNrIG9nAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:52:12.360111Z"},"content_sha256":"f8872adf8030547ad8a76ef63d58deff92e617bf7d89a89d62f71e6ebe74d4e2","schema_version":"1.0","event_id":"sha256:f8872adf8030547ad8a76ef63d58deff92e617bf7d89a89d62f71e6ebe74d4e2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W6EBWNXPEENTZGLLNECVJ4GTXZ/bundle.json","state_url":"https://pith.science/pith/W6EBWNXPEENTZGLLNECVJ4GTXZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W6EBWNXPEENTZGLLNECVJ4GTXZ/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-02T16:52:12Z","links":{"resolver":"https://pith.science/pith/W6EBWNXPEENTZGLLNECVJ4GTXZ","bundle":"https://pith.science/pith/W6EBWNXPEENTZGLLNECVJ4GTXZ/bundle.json","state":"https://pith.science/pith/W6EBWNXPEENTZGLLNECVJ4GTXZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W6EBWNXPEENTZGLLNECVJ4GTXZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:W6EBWNXPEENTZGLLNECVJ4GTXZ","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":"13e8e95b043adf02b1324e38b3e6bcab3e5b699518fcad91e18e1876e249e5a5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-06-15T18:32:43Z","title_canon_sha256":"970f6222e51c6a2227cfd052e06f0487a41104b7883b07d5f5ac0e8f59cad2db"},"schema_version":"1.0","source":{"id":"1406.3838","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.3838","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"arxiv_version","alias_value":"1406.3838v1","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3838","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"pith_short_12","alias_value":"W6EBWNXPEENT","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"W6EBWNXPEENTZGLL","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"W6EBWNXP","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:f8872adf8030547ad8a76ef63d58deff92e617bf7d89a89d62f71e6ebe74d4e2","target":"graph","created_at":"2026-05-18T02:49:39Z","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":"Given a point set P in 2D, the problem of finding the smallest set of unit disks that cover all of P is NP-hard. We present a simple algorithm for this problem with an approximation factor of 25/6 in the Euclidean norm and 2 in the max norm, by restricting the disk centers to lie on parallel lines. The run time and space of this algorithm is O(n log n) and O(n) respectively. This algorithm extends to any Lp norm and is asymptotically faster than known alternative approximation algorithms for the same approximation factor.","authors_text":"Daniel Lu, Paul Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-06-15T18:32:43Z","title":"A fast 25/6-approximation for the minimum unit disk cover problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3838","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:628415f8dc7d14d26594b4340a06dc1d75fc851effd8a79f1e45935cf66758a8","target":"record","created_at":"2026-05-18T02:49:39Z","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":"13e8e95b043adf02b1324e38b3e6bcab3e5b699518fcad91e18e1876e249e5a5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-06-15T18:32:43Z","title_canon_sha256":"970f6222e51c6a2227cfd052e06f0487a41104b7883b07d5f5ac0e8f59cad2db"},"schema_version":"1.0","source":{"id":"1406.3838","kind":"arxiv","version":1}},"canonical_sha256":"b7881b36ef211b3c996b690554f0d3be50b0248d4a53f0032b500711f1da66aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b7881b36ef211b3c996b690554f0d3be50b0248d4a53f0032b500711f1da66aa","first_computed_at":"2026-05-18T02:49:39.643969Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:39.643969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+ebXeRHlXn0wBr6qFfW8XG3d3hV+SG1wfo1vvdudi6Z0LOFb60Aq+yotDH6vLn0A/QrSYOK5A8XObWP5gSilCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:39.644293Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.3838","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:628415f8dc7d14d26594b4340a06dc1d75fc851effd8a79f1e45935cf66758a8","sha256:f8872adf8030547ad8a76ef63d58deff92e617bf7d89a89d62f71e6ebe74d4e2"],"state_sha256":"c9742fbd6e8e08e60cfc976c9eb815539e6f2787ad3365cb08e5b9d710770812"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+fMO+gq1e8aDFOe2JxIlz+ceySYja83Gf7LPSiu/wLp9nH+5gXS4FDSjGE8dQ/hWYRL1xo1exmlhMBjRNuiXBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T16:52:12.362076Z","bundle_sha256":"4b8241074c06ba81eae58b0d2d670c7fcb75da2cdff327b05db3caa5f1117c42"}}