{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:3ED2RKSAWKNQYDWP4A4IZG3YLN","short_pith_number":"pith:3ED2RKSA","schema_version":"1.0","canonical_sha256":"d907a8aa40b29b0c0ecfe0388c9b785b7754cb56eb881ba6b7ea22992d216c49","source":{"kind":"arxiv","id":"1312.0389","version":1},"attestation_state":"computed","paper":{"title":"Output sensitive algorithm for covering many points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Hossein Ghasemalizadeh, Mohammadreza Razzazi","submitted_at":"2013-12-02T09:46:22Z","abstract_excerpt":"A set of points and a positive integer $m$ are given and our goal is to cover the maximum number of these point with $m$ disks. We devise the first output sensitive algorithm for this problem. We introduce a parameter $\\rho$ as the maximum number of points that one disk can cover. In this paper first we solve the problem for $m=2$ in $O({n\\rho} + {\\rho ^3}\\log \\rho ))$ time. The previous algorithm for this problem runs in $O({n^3}\\log n)$ time. Our algorithm outperforms the previous algorithm because $\\rho$ is much smaller than $n$ in many cases. Then we extend the algorithm for any value of $"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1312.0389","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-12-02T09:46:22Z","cross_cats_sorted":[],"title_canon_sha256":"35eba6b082ec228376e97d0d900a1d99af3c7644ee0a40aeb8f0dec408ea15ac","abstract_canon_sha256":"9c4817b39a11c576db386fd7b9689b8613d83477e207e3e379dc572600e7ce39"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:45.823603Z","signature_b64":"/ZhSq+29Iw5lCJl73zBKZ69nncby80/08TTBFZiYBLp5ZOcOVn9XPAd7pCX3A9XL5NucYzbCC/8ilLlYXC2IBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d907a8aa40b29b0c0ecfe0388c9b785b7754cb56eb881ba6b7ea22992d216c49","last_reissued_at":"2026-05-18T03:05:45.822952Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:45.822952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Output sensitive algorithm for covering many points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Hossein Ghasemalizadeh, Mohammadreza Razzazi","submitted_at":"2013-12-02T09:46:22Z","abstract_excerpt":"A set of points and a positive integer $m$ are given and our goal is to cover the maximum number of these point with $m$ disks. We devise the first output sensitive algorithm for this problem. We introduce a parameter $\\rho$ as the maximum number of points that one disk can cover. In this paper first we solve the problem for $m=2$ in $O({n\\rho} + {\\rho ^3}\\log \\rho ))$ time. The previous algorithm for this problem runs in $O({n^3}\\log n)$ time. Our algorithm outperforms the previous algorithm because $\\rho$ is much smaller than $n$ in many cases. Then we extend the algorithm for any value of $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0389","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1312.0389","created_at":"2026-05-18T03:05:45.823025+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.0389v1","created_at":"2026-05-18T03:05:45.823025+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0389","created_at":"2026-05-18T03:05:45.823025+00:00"},{"alias_kind":"pith_short_12","alias_value":"3ED2RKSAWKNQ","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"3ED2RKSAWKNQYDWP","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"3ED2RKSA","created_at":"2026-05-18T12:27:32.513160+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3ED2RKSAWKNQYDWP4A4IZG3YLN","json":"https://pith.science/pith/3ED2RKSAWKNQYDWP4A4IZG3YLN.json","graph_json":"https://pith.science/api/pith-number/3ED2RKSAWKNQYDWP4A4IZG3YLN/graph.json","events_json":"https://pith.science/api/pith-number/3ED2RKSAWKNQYDWP4A4IZG3YLN/events.json","paper":"https://pith.science/paper/3ED2RKSA"},"agent_actions":{"view_html":"https://pith.science/pith/3ED2RKSAWKNQYDWP4A4IZG3YLN","download_json":"https://pith.science/pith/3ED2RKSAWKNQYDWP4A4IZG3YLN.json","view_paper":"https://pith.science/paper/3ED2RKSA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.0389&json=true","fetch_graph":"https://pith.science/api/pith-number/3ED2RKSAWKNQYDWP4A4IZG3YLN/graph.json","fetch_events":"https://pith.science/api/pith-number/3ED2RKSAWKNQYDWP4A4IZG3YLN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3ED2RKSAWKNQYDWP4A4IZG3YLN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3ED2RKSAWKNQYDWP4A4IZG3YLN/action/storage_attestation","attest_author":"https://pith.science/pith/3ED2RKSAWKNQYDWP4A4IZG3YLN/action/author_attestation","sign_citation":"https://pith.science/pith/3ED2RKSAWKNQYDWP4A4IZG3YLN/action/citation_signature","submit_replication":"https://pith.science/pith/3ED2RKSAWKNQYDWP4A4IZG3YLN/action/replication_record"}},"created_at":"2026-05-18T03:05:45.823025+00:00","updated_at":"2026-05-18T03:05:45.823025+00:00"}