{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:3ED2RKSAWKNQYDWP4A4IZG3YLN","short_pith_number":"pith:3ED2RKSA","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"},"canonical_sha256":"d907a8aa40b29b0c0ecfe0388c9b785b7754cb56eb881ba6b7ea22992d216c49","source":{"kind":"arxiv","id":"1312.0389","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.0389","created_at":"2026-05-18T03:05:45Z"},{"alias_kind":"arxiv_version","alias_value":"1312.0389v1","created_at":"2026-05-18T03:05:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0389","created_at":"2026-05-18T03:05:45Z"},{"alias_kind":"pith_short_12","alias_value":"3ED2RKSAWKNQ","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3ED2RKSAWKNQYDWP","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3ED2RKSA","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:3ED2RKSAWKNQYDWP4A4IZG3YLN","target":"record","payload":{"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"},"canonical_sha256":"d907a8aa40b29b0c0ecfe0388c9b785b7754cb56eb881ba6b7ea22992d216c49","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"},"source_kind":"arxiv","source_id":"1312.0389","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:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QV++cwYhudCHJodB67G+HFaPc6QxU5lRf7VC+vPLtBrTFP9GI7AIg+zVEGdb5ObbMOc/OA1vuNaA8GM9RH96DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:01:21.296224Z"},"content_sha256":"bf32430b1dbda997636e6793c36c46fe30f2b2aaf320a75d48f67433bc34ae5d","schema_version":"1.0","event_id":"sha256:bf32430b1dbda997636e6793c36c46fe30f2b2aaf320a75d48f67433bc34ae5d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:3ED2RKSAWKNQYDWP4A4IZG3YLN","target":"graph","payload":{"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"},"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:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AgZVUqmkfxuZsEGgV1REhs10eX7jR5qpklFX1PsgeHbhn3yTpY0vrXv/L7GFmHTaxCB0nRxUnM7VSrqMhY87AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:01:21.296574Z"},"content_sha256":"6c616ca6a9aa3d943e93ccf47f65761f784c00ba608344bbd7fe1285e0177ec6","schema_version":"1.0","event_id":"sha256:6c616ca6a9aa3d943e93ccf47f65761f784c00ba608344bbd7fe1285e0177ec6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3ED2RKSAWKNQYDWP4A4IZG3YLN/bundle.json","state_url":"https://pith.science/pith/3ED2RKSAWKNQYDWP4A4IZG3YLN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3ED2RKSAWKNQYDWP4A4IZG3YLN/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-01T08:01:21Z","links":{"resolver":"https://pith.science/pith/3ED2RKSAWKNQYDWP4A4IZG3YLN","bundle":"https://pith.science/pith/3ED2RKSAWKNQYDWP4A4IZG3YLN/bundle.json","state":"https://pith.science/pith/3ED2RKSAWKNQYDWP4A4IZG3YLN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3ED2RKSAWKNQYDWP4A4IZG3YLN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3ED2RKSAWKNQYDWP4A4IZG3YLN","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":"9c4817b39a11c576db386fd7b9689b8613d83477e207e3e379dc572600e7ce39","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-12-02T09:46:22Z","title_canon_sha256":"35eba6b082ec228376e97d0d900a1d99af3c7644ee0a40aeb8f0dec408ea15ac"},"schema_version":"1.0","source":{"id":"1312.0389","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.0389","created_at":"2026-05-18T03:05:45Z"},{"alias_kind":"arxiv_version","alias_value":"1312.0389v1","created_at":"2026-05-18T03:05:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0389","created_at":"2026-05-18T03:05:45Z"},{"alias_kind":"pith_short_12","alias_value":"3ED2RKSAWKNQ","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3ED2RKSAWKNQYDWP","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3ED2RKSA","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:6c616ca6a9aa3d943e93ccf47f65761f784c00ba608344bbd7fe1285e0177ec6","target":"graph","created_at":"2026-05-18T03:05:45Z","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":"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 $","authors_text":"Hossein Ghasemalizadeh, Mohammadreza Razzazi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-12-02T09:46:22Z","title":"Output sensitive algorithm for covering many points"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0389","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:bf32430b1dbda997636e6793c36c46fe30f2b2aaf320a75d48f67433bc34ae5d","target":"record","created_at":"2026-05-18T03:05:45Z","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":"9c4817b39a11c576db386fd7b9689b8613d83477e207e3e379dc572600e7ce39","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-12-02T09:46:22Z","title_canon_sha256":"35eba6b082ec228376e97d0d900a1d99af3c7644ee0a40aeb8f0dec408ea15ac"},"schema_version":"1.0","source":{"id":"1312.0389","kind":"arxiv","version":1}},"canonical_sha256":"d907a8aa40b29b0c0ecfe0388c9b785b7754cb56eb881ba6b7ea22992d216c49","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d907a8aa40b29b0c0ecfe0388c9b785b7754cb56eb881ba6b7ea22992d216c49","first_computed_at":"2026-05-18T03:05:45.822952Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:45.822952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/ZhSq+29Iw5lCJl73zBKZ69nncby80/08TTBFZiYBLp5ZOcOVn9XPAd7pCX3A9XL5NucYzbCC/8ilLlYXC2IBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:45.823603Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.0389","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf32430b1dbda997636e6793c36c46fe30f2b2aaf320a75d48f67433bc34ae5d","sha256:6c616ca6a9aa3d943e93ccf47f65761f784c00ba608344bbd7fe1285e0177ec6"],"state_sha256":"e45c4f6c7b089788813b5037c96543f37b5f5ba4484cf642f308d5c974b9220f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XRXQAfLB4lHMsKBRKH1eDRbfuX9kq8/I5eRCEWIlLMNO3qVhuQWGKptltzXlnJS4CZdKVAvX2RUPo+9gZqjkBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T08:01:21.298448Z","bundle_sha256":"132326e1281bac2f52b08dd65b9ec5233c3ce6e5dbe3fea9a43ac58a96ec5bfb"}}