{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AVWSU537FQERQO5FJM5CDJACE7","short_pith_number":"pith:AVWSU537","schema_version":"1.0","canonical_sha256":"056d2a777f2c09183ba54b3a21a40227dce949fd8f18a208e0cda7cff4736f25","source":{"kind":"arxiv","id":"1802.09505","version":2},"attestation_state":"computed","paper":{"title":"Faster Algorithms for some Optimization Problems on Collinear Points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ahmad Biniaz, Anil Maheshwari, J. Ian Munro, Michiel Smid, Paz Carmi, Prosenjit Bose","submitted_at":"2018-02-26T18:40:05Z","abstract_excerpt":"We propose faster algorithms for the following three optimization problems on $n$ collinear points, i.e., points in dimension one. The first two problems are known to be NP-hard in higher dimensions.\n  1- Maximizing total area of disjoint disks: In this problem the goal is to maximize the total area of nonoverlapping disks centered at the points. Acharyya, De, and Nandy (2017) presented an $O(n^2)$-time algorithm for this problem. We present an optimal $\\Theta(n)$-time algorithm.\n  2- Minimizing sum of the radii of client-server coverage: The $n$ points are partitioned into two sets, namely cl"},"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":"1802.09505","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-02-26T18:40:05Z","cross_cats_sorted":[],"title_canon_sha256":"6fcaaa5099e71b434beb1f6db888509234509023c2b38bb83fb1048526ee7f53","abstract_canon_sha256":"4f198fd81d16ccc123afa88171f3d3636f4a84d8fb611df65c1970b26f094d41"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:47.292119Z","signature_b64":"hCV5EGFkjISGckrvw0biICZfVGFNDtTH3rWQvxPSlZo3TX9BuKpf/U3VZTDxjCmvjnvDTvn1Di7PaTfqoFY2Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"056d2a777f2c09183ba54b3a21a40227dce949fd8f18a208e0cda7cff4736f25","last_reissued_at":"2026-05-18T00:09:47.291578Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:47.291578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Algorithms for some Optimization Problems on Collinear Points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ahmad Biniaz, Anil Maheshwari, J. Ian Munro, Michiel Smid, Paz Carmi, Prosenjit Bose","submitted_at":"2018-02-26T18:40:05Z","abstract_excerpt":"We propose faster algorithms for the following three optimization problems on $n$ collinear points, i.e., points in dimension one. The first two problems are known to be NP-hard in higher dimensions.\n  1- Maximizing total area of disjoint disks: In this problem the goal is to maximize the total area of nonoverlapping disks centered at the points. Acharyya, De, and Nandy (2017) presented an $O(n^2)$-time algorithm for this problem. We present an optimal $\\Theta(n)$-time algorithm.\n  2- Minimizing sum of the radii of client-server coverage: The $n$ points are partitioned into two sets, namely cl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09505","kind":"arxiv","version":2},"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":"1802.09505","created_at":"2026-05-18T00:09:47.291668+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.09505v2","created_at":"2026-05-18T00:09:47.291668+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09505","created_at":"2026-05-18T00:09:47.291668+00:00"},{"alias_kind":"pith_short_12","alias_value":"AVWSU537FQER","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AVWSU537FQERQO5F","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AVWSU537","created_at":"2026-05-18T12:32:13.499390+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/AVWSU537FQERQO5FJM5CDJACE7","json":"https://pith.science/pith/AVWSU537FQERQO5FJM5CDJACE7.json","graph_json":"https://pith.science/api/pith-number/AVWSU537FQERQO5FJM5CDJACE7/graph.json","events_json":"https://pith.science/api/pith-number/AVWSU537FQERQO5FJM5CDJACE7/events.json","paper":"https://pith.science/paper/AVWSU537"},"agent_actions":{"view_html":"https://pith.science/pith/AVWSU537FQERQO5FJM5CDJACE7","download_json":"https://pith.science/pith/AVWSU537FQERQO5FJM5CDJACE7.json","view_paper":"https://pith.science/paper/AVWSU537","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.09505&json=true","fetch_graph":"https://pith.science/api/pith-number/AVWSU537FQERQO5FJM5CDJACE7/graph.json","fetch_events":"https://pith.science/api/pith-number/AVWSU537FQERQO5FJM5CDJACE7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AVWSU537FQERQO5FJM5CDJACE7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AVWSU537FQERQO5FJM5CDJACE7/action/storage_attestation","attest_author":"https://pith.science/pith/AVWSU537FQERQO5FJM5CDJACE7/action/author_attestation","sign_citation":"https://pith.science/pith/AVWSU537FQERQO5FJM5CDJACE7/action/citation_signature","submit_replication":"https://pith.science/pith/AVWSU537FQERQO5FJM5CDJACE7/action/replication_record"}},"created_at":"2026-05-18T00:09:47.291668+00:00","updated_at":"2026-05-18T00:09:47.291668+00:00"}