{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:RBW7BYLAAPF22AK34C2IU3IIL6","short_pith_number":"pith:RBW7BYLA","canonical_record":{"source":{"id":"1312.2549","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-12-09T19:14:05Z","cross_cats_sorted":[],"title_canon_sha256":"4f1b49857e5f74dc63f556867c8f3a7c259bac93b7cbc8aa47f5bf96d8781229","abstract_canon_sha256":"2fddd9200458bde881ef84bd90fc6b2dabc15991bf73eb4c1a9f58bfd28fbc1b"},"schema_version":"1.0"},"canonical_sha256":"886df0e16003cbad015be0b48a6d085fa9401813f77f11c6722d2d9c82e07004","source":{"kind":"arxiv","id":"1312.2549","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.2549","created_at":"2026-05-18T03:05:10Z"},{"alias_kind":"arxiv_version","alias_value":"1312.2549v1","created_at":"2026-05-18T03:05:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2549","created_at":"2026-05-18T03:05:10Z"},{"alias_kind":"pith_short_12","alias_value":"RBW7BYLAAPF2","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"RBW7BYLAAPF22AK3","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"RBW7BYLA","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:RBW7BYLAAPF22AK34C2IU3IIL6","target":"record","payload":{"canonical_record":{"source":{"id":"1312.2549","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-12-09T19:14:05Z","cross_cats_sorted":[],"title_canon_sha256":"4f1b49857e5f74dc63f556867c8f3a7c259bac93b7cbc8aa47f5bf96d8781229","abstract_canon_sha256":"2fddd9200458bde881ef84bd90fc6b2dabc15991bf73eb4c1a9f58bfd28fbc1b"},"schema_version":"1.0"},"canonical_sha256":"886df0e16003cbad015be0b48a6d085fa9401813f77f11c6722d2d9c82e07004","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:10.027205Z","signature_b64":"2YMLZGEVZ8EVdR9oGibvvPxA/mD97WXndQi8Abm4njhwQiZqyA7HuAUPwIZX+t1dCng2tlTVe/ziLIF7pBLVBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"886df0e16003cbad015be0b48a6d085fa9401813f77f11c6722d2d9c82e07004","last_reissued_at":"2026-05-18T03:05:10.026752Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:10.026752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.2549","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-18T03:05:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eBJ7zjluFkZBSdB2GI+QU2S/h73WDENIZRk+actXcVGuOY7bcqp8ytfS5M6bab58iMqcFVz47UF2O0N+QJexAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:04:57.524221Z"},"content_sha256":"ede6bb5475e592f12cbeda26dc091eca477149b7479cc1c836ee2ef58dd7a81d","schema_version":"1.0","event_id":"sha256:ede6bb5475e592f12cbeda26dc091eca477149b7479cc1c836ee2ef58dd7a81d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:RBW7BYLAAPF22AK34C2IU3IIL6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the approximability of covering points by lines and related problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Adrian Dumitrescu, Minghui Jiang","submitted_at":"2013-12-09T19:14:05Z","abstract_excerpt":"Given a set $P$ of $n$ points in the plane, {\\sc Covering Points by Lines} is the problem of finding a minimum-cardinality set $\\L$ of lines such that every point $p \\in P$ is incident to some line $\\ell \\in \\L$. As a geometric variant of {\\sc Set Cover}, {\\sc Covering Points by Lines} is still NP-hard. Moreover, it has been proved to be APX-hard, and hence does not admit any polynomial-time approximation scheme unless P $=$ NP\\@. In contrast to the small constant approximation lower bound implied by APX-hardness, the current best approximation ratio for {\\sc Covering Points by Lines} is still"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2549","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-18T03:05:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kSg+nPuka4D26Uu5/BrBlnJCJU96Q9yesfQolzaaCGOalTFhIRjiU0XgyaORg1P6AeH/S1NSzckV0q3G/3SYDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:04:57.524685Z"},"content_sha256":"c1f93d6a3a8621e7008a9f7867eccf0533e2cea4cdb83545728e2bcc30c3cf70","schema_version":"1.0","event_id":"sha256:c1f93d6a3a8621e7008a9f7867eccf0533e2cea4cdb83545728e2bcc30c3cf70"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RBW7BYLAAPF22AK34C2IU3IIL6/bundle.json","state_url":"https://pith.science/pith/RBW7BYLAAPF22AK34C2IU3IIL6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RBW7BYLAAPF22AK34C2IU3IIL6/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-30T00:04:57Z","links":{"resolver":"https://pith.science/pith/RBW7BYLAAPF22AK34C2IU3IIL6","bundle":"https://pith.science/pith/RBW7BYLAAPF22AK34C2IU3IIL6/bundle.json","state":"https://pith.science/pith/RBW7BYLAAPF22AK34C2IU3IIL6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RBW7BYLAAPF22AK34C2IU3IIL6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:RBW7BYLAAPF22AK34C2IU3IIL6","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":"2fddd9200458bde881ef84bd90fc6b2dabc15991bf73eb4c1a9f58bfd28fbc1b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-12-09T19:14:05Z","title_canon_sha256":"4f1b49857e5f74dc63f556867c8f3a7c259bac93b7cbc8aa47f5bf96d8781229"},"schema_version":"1.0","source":{"id":"1312.2549","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.2549","created_at":"2026-05-18T03:05:10Z"},{"alias_kind":"arxiv_version","alias_value":"1312.2549v1","created_at":"2026-05-18T03:05:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2549","created_at":"2026-05-18T03:05:10Z"},{"alias_kind":"pith_short_12","alias_value":"RBW7BYLAAPF2","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"RBW7BYLAAPF22AK3","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"RBW7BYLA","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:c1f93d6a3a8621e7008a9f7867eccf0533e2cea4cdb83545728e2bcc30c3cf70","target":"graph","created_at":"2026-05-18T03:05:10Z","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 set $P$ of $n$ points in the plane, {\\sc Covering Points by Lines} is the problem of finding a minimum-cardinality set $\\L$ of lines such that every point $p \\in P$ is incident to some line $\\ell \\in \\L$. As a geometric variant of {\\sc Set Cover}, {\\sc Covering Points by Lines} is still NP-hard. Moreover, it has been proved to be APX-hard, and hence does not admit any polynomial-time approximation scheme unless P $=$ NP\\@. In contrast to the small constant approximation lower bound implied by APX-hardness, the current best approximation ratio for {\\sc Covering Points by Lines} is still","authors_text":"Adrian Dumitrescu, Minghui Jiang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-12-09T19:14:05Z","title":"On the approximability of covering points by lines and related problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2549","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:ede6bb5475e592f12cbeda26dc091eca477149b7479cc1c836ee2ef58dd7a81d","target":"record","created_at":"2026-05-18T03:05:10Z","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":"2fddd9200458bde881ef84bd90fc6b2dabc15991bf73eb4c1a9f58bfd28fbc1b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-12-09T19:14:05Z","title_canon_sha256":"4f1b49857e5f74dc63f556867c8f3a7c259bac93b7cbc8aa47f5bf96d8781229"},"schema_version":"1.0","source":{"id":"1312.2549","kind":"arxiv","version":1}},"canonical_sha256":"886df0e16003cbad015be0b48a6d085fa9401813f77f11c6722d2d9c82e07004","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"886df0e16003cbad015be0b48a6d085fa9401813f77f11c6722d2d9c82e07004","first_computed_at":"2026-05-18T03:05:10.026752Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:10.026752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2YMLZGEVZ8EVdR9oGibvvPxA/mD97WXndQi8Abm4njhwQiZqyA7HuAUPwIZX+t1dCng2tlTVe/ziLIF7pBLVBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:10.027205Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.2549","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ede6bb5475e592f12cbeda26dc091eca477149b7479cc1c836ee2ef58dd7a81d","sha256:c1f93d6a3a8621e7008a9f7867eccf0533e2cea4cdb83545728e2bcc30c3cf70"],"state_sha256":"cd2ba8c69668ff37a745f8b9614a060b0b1369a0324aa1cbca30001693230484"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1/5EMVPlgdkeKMFoHqvhfvKCll2LjZa7ZgkKcH5sP8xtSlzClGlIQu/QYmoqofcD4MCcs6Jp3rQ/5TUi6CS2Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T00:04:57.528746Z","bundle_sha256":"c1853519f26c388ec1b2c92fd8d53444b885807d46bb8a666cfaeac40ddda383"}}