{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:FA5HXE7HH475ZEKD4W6GH3OPWB","short_pith_number":"pith:FA5HXE7H","canonical_record":{"source":{"id":"1502.04918","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-02-17T15:18:40Z","cross_cats_sorted":[],"title_canon_sha256":"07589013d7f207838c6d59e3425c2693b44a3135fb3653a09ba8cafaa98a003a","abstract_canon_sha256":"7491cfce47cc2977643aca547cb76568a611f2cd28afef46e9efb0cec8d2bc6e"},"schema_version":"1.0"},"canonical_sha256":"283a7b93e73f3fdc9143e5bc63edcfb0525f4fe8301c3402c180be5f831dae75","source":{"kind":"arxiv","id":"1502.04918","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04918","created_at":"2026-05-18T01:23:04Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04918v3","created_at":"2026-05-18T01:23:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04918","created_at":"2026-05-18T01:23:04Z"},{"alias_kind":"pith_short_12","alias_value":"FA5HXE7HH475","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FA5HXE7HH475ZEKD","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FA5HXE7H","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:FA5HXE7HH475ZEKD4W6GH3OPWB","target":"record","payload":{"canonical_record":{"source":{"id":"1502.04918","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-02-17T15:18:40Z","cross_cats_sorted":[],"title_canon_sha256":"07589013d7f207838c6d59e3425c2693b44a3135fb3653a09ba8cafaa98a003a","abstract_canon_sha256":"7491cfce47cc2977643aca547cb76568a611f2cd28afef46e9efb0cec8d2bc6e"},"schema_version":"1.0"},"canonical_sha256":"283a7b93e73f3fdc9143e5bc63edcfb0525f4fe8301c3402c180be5f831dae75","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:04.235733Z","signature_b64":"qOBbQ5S3VhYCA899pdt66rvgVIrCFmQ+17VzIWfeDxwl86XCqZwkH8pW8yXN69p+WOGF1bqFsvnoMcFZiFqnCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"283a7b93e73f3fdc9143e5bc63edcfb0525f4fe8301c3402c180be5f831dae75","last_reissued_at":"2026-05-18T01:23:04.235159Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:04.235159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.04918","source_version":3,"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:23:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QbEqi/6rA1ty5IFKMfIixzlSDrISZglxS/1HWwB47QbjJ/FZA/xAW6IeGyMO/8PnaBX1kYvyym5kEmbDjwuUAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:41:47.093127Z"},"content_sha256":"6ae804b6bda192c931245d3bde68885b44c745c9e0379f2a757e2f8c2b4af80f","schema_version":"1.0","event_id":"sha256:6ae804b6bda192c931245d3bde68885b44c745c9e0379f2a757e2f8c2b4af80f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:FA5HXE7HH475ZEKD4W6GH3OPWB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A PTAS for the Weighted Unit Disk Cover Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Jian Li, Yifei Jin","submitted_at":"2015-02-17T15:18:40Z","abstract_excerpt":"We are given a set of weighted unit disks and a set of points in Euclidean plane. The minimum weight unit disk cover (\\UDC) problem asks for a subset of disks of minimum total weight that covers all given points. \\UDC\\ is one of the geometric set cover problems, which have been studied extensively for the past two decades (for many different geometric range spaces, such as (unit) disks, halfspaces, rectangles, triangles). It is known that the unweighted \\UDC\\ problem is NP-hard and admits a polynomial-time approximation scheme (PTAS). For the weighted \\UDC\\ problem, several constant approximat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04918","kind":"arxiv","version":3},"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:23:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JEZr7uZufUxskhiyGOQWeD4uczcuIETlag6V9L1RJ8/d51kvwyCEKVrnE0D8+oAGvHtvw8wQ3AYpQEiwVlt4Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:41:47.093828Z"},"content_sha256":"5d17bdab33d88062977383182b5fd92361bf2316dfa1c9700a1c29c6b143b43d","schema_version":"1.0","event_id":"sha256:5d17bdab33d88062977383182b5fd92361bf2316dfa1c9700a1c29c6b143b43d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FA5HXE7HH475ZEKD4W6GH3OPWB/bundle.json","state_url":"https://pith.science/pith/FA5HXE7HH475ZEKD4W6GH3OPWB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FA5HXE7HH475ZEKD4W6GH3OPWB/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-06T20:41:47Z","links":{"resolver":"https://pith.science/pith/FA5HXE7HH475ZEKD4W6GH3OPWB","bundle":"https://pith.science/pith/FA5HXE7HH475ZEKD4W6GH3OPWB/bundle.json","state":"https://pith.science/pith/FA5HXE7HH475ZEKD4W6GH3OPWB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FA5HXE7HH475ZEKD4W6GH3OPWB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FA5HXE7HH475ZEKD4W6GH3OPWB","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":"7491cfce47cc2977643aca547cb76568a611f2cd28afef46e9efb0cec8d2bc6e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-02-17T15:18:40Z","title_canon_sha256":"07589013d7f207838c6d59e3425c2693b44a3135fb3653a09ba8cafaa98a003a"},"schema_version":"1.0","source":{"id":"1502.04918","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04918","created_at":"2026-05-18T01:23:04Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04918v3","created_at":"2026-05-18T01:23:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04918","created_at":"2026-05-18T01:23:04Z"},{"alias_kind":"pith_short_12","alias_value":"FA5HXE7HH475","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FA5HXE7HH475ZEKD","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FA5HXE7H","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:5d17bdab33d88062977383182b5fd92361bf2316dfa1c9700a1c29c6b143b43d","target":"graph","created_at":"2026-05-18T01:23:04Z","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 are given a set of weighted unit disks and a set of points in Euclidean plane. The minimum weight unit disk cover (\\UDC) problem asks for a subset of disks of minimum total weight that covers all given points. \\UDC\\ is one of the geometric set cover problems, which have been studied extensively for the past two decades (for many different geometric range spaces, such as (unit) disks, halfspaces, rectangles, triangles). It is known that the unweighted \\UDC\\ problem is NP-hard and admits a polynomial-time approximation scheme (PTAS). For the weighted \\UDC\\ problem, several constant approximat","authors_text":"Jian Li, Yifei Jin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-02-17T15:18:40Z","title":"A PTAS for the Weighted Unit Disk Cover Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04918","kind":"arxiv","version":3},"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:6ae804b6bda192c931245d3bde68885b44c745c9e0379f2a757e2f8c2b4af80f","target":"record","created_at":"2026-05-18T01:23:04Z","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":"7491cfce47cc2977643aca547cb76568a611f2cd28afef46e9efb0cec8d2bc6e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-02-17T15:18:40Z","title_canon_sha256":"07589013d7f207838c6d59e3425c2693b44a3135fb3653a09ba8cafaa98a003a"},"schema_version":"1.0","source":{"id":"1502.04918","kind":"arxiv","version":3}},"canonical_sha256":"283a7b93e73f3fdc9143e5bc63edcfb0525f4fe8301c3402c180be5f831dae75","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"283a7b93e73f3fdc9143e5bc63edcfb0525f4fe8301c3402c180be5f831dae75","first_computed_at":"2026-05-18T01:23:04.235159Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:04.235159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qOBbQ5S3VhYCA899pdt66rvgVIrCFmQ+17VzIWfeDxwl86XCqZwkH8pW8yXN69p+WOGF1bqFsvnoMcFZiFqnCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:04.235733Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.04918","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ae804b6bda192c931245d3bde68885b44c745c9e0379f2a757e2f8c2b4af80f","sha256:5d17bdab33d88062977383182b5fd92361bf2316dfa1c9700a1c29c6b143b43d"],"state_sha256":"819cf65970dfd7bbe3ea5dc3f06542f813ae9b06c8867058e3b916d79517ac73"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bsMVGnJX617wrDuXqRCwxLFNTJyExvMl0c1MTcbaOHA9tY9+wIFETOqjON4LTiTu/oz7ncB+V3Obza3o9xgCDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T20:41:47.097891Z","bundle_sha256":"438aaad57e582d67d7f7d4f37ac80262a9185edf75cf715231d4ace3276ca38e"}}