{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AVWSU537FQERQO5FJM5CDJACE7","short_pith_number":"pith:AVWSU537","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"},"canonical_sha256":"056d2a777f2c09183ba54b3a21a40227dce949fd8f18a208e0cda7cff4736f25","source":{"kind":"arxiv","id":"1802.09505","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09505","created_at":"2026-05-18T00:09:47Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09505v2","created_at":"2026-05-18T00:09:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09505","created_at":"2026-05-18T00:09:47Z"},{"alias_kind":"pith_short_12","alias_value":"AVWSU537FQER","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AVWSU537FQERQO5F","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AVWSU537","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AVWSU537FQERQO5FJM5CDJACE7","target":"record","payload":{"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"},"canonical_sha256":"056d2a777f2c09183ba54b3a21a40227dce949fd8f18a208e0cda7cff4736f25","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"},"source_kind":"arxiv","source_id":"1802.09505","source_version":2,"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-18T00:09:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AhdS5K5IMWUJ2tFVjhtBsWWORbUss7GMzJ0nIsCFxXK2FWUPM+PoRMd88ij3jiw1XpUYd6NMQkTS4YV/0eeoAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:04:55.629545Z"},"content_sha256":"4e68f1e9a58d9541e0eb8eccea4dc345028dbee376e88ddbc62897d1674a9a52","schema_version":"1.0","event_id":"sha256:4e68f1e9a58d9541e0eb8eccea4dc345028dbee376e88ddbc62897d1674a9a52"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AVWSU537FQERQO5FJM5CDJACE7","target":"graph","payload":{"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"},"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-18T00:09:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"db3mz6wvkYLQ6En5GCZN7XEVs47MEPvyt27+XzsoydS71OKULeZXhuUMH2Heg4UHQL7uAp+/rH69CcwfMNCQBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:04:55.630273Z"},"content_sha256":"03d1693de66d0f79b26bad167363c25d3f368ad6ef66d6d67f5201c8c9e880f8","schema_version":"1.0","event_id":"sha256:03d1693de66d0f79b26bad167363c25d3f368ad6ef66d6d67f5201c8c9e880f8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AVWSU537FQERQO5FJM5CDJACE7/bundle.json","state_url":"https://pith.science/pith/AVWSU537FQERQO5FJM5CDJACE7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AVWSU537FQERQO5FJM5CDJACE7/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-25T16:04:55Z","links":{"resolver":"https://pith.science/pith/AVWSU537FQERQO5FJM5CDJACE7","bundle":"https://pith.science/pith/AVWSU537FQERQO5FJM5CDJACE7/bundle.json","state":"https://pith.science/pith/AVWSU537FQERQO5FJM5CDJACE7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AVWSU537FQERQO5FJM5CDJACE7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AVWSU537FQERQO5FJM5CDJACE7","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":"4f198fd81d16ccc123afa88171f3d3636f4a84d8fb611df65c1970b26f094d41","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-02-26T18:40:05Z","title_canon_sha256":"6fcaaa5099e71b434beb1f6db888509234509023c2b38bb83fb1048526ee7f53"},"schema_version":"1.0","source":{"id":"1802.09505","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09505","created_at":"2026-05-18T00:09:47Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09505v2","created_at":"2026-05-18T00:09:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09505","created_at":"2026-05-18T00:09:47Z"},{"alias_kind":"pith_short_12","alias_value":"AVWSU537FQER","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AVWSU537FQERQO5F","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AVWSU537","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:03d1693de66d0f79b26bad167363c25d3f368ad6ef66d6d67f5201c8c9e880f8","target":"graph","created_at":"2026-05-18T00:09:47Z","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 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","authors_text":"Ahmad Biniaz, Anil Maheshwari, J. Ian Munro, Michiel Smid, Paz Carmi, Prosenjit Bose","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-02-26T18:40:05Z","title":"Faster Algorithms for some Optimization Problems on Collinear Points"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09505","kind":"arxiv","version":2},"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:4e68f1e9a58d9541e0eb8eccea4dc345028dbee376e88ddbc62897d1674a9a52","target":"record","created_at":"2026-05-18T00:09:47Z","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":"4f198fd81d16ccc123afa88171f3d3636f4a84d8fb611df65c1970b26f094d41","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-02-26T18:40:05Z","title_canon_sha256":"6fcaaa5099e71b434beb1f6db888509234509023c2b38bb83fb1048526ee7f53"},"schema_version":"1.0","source":{"id":"1802.09505","kind":"arxiv","version":2}},"canonical_sha256":"056d2a777f2c09183ba54b3a21a40227dce949fd8f18a208e0cda7cff4736f25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"056d2a777f2c09183ba54b3a21a40227dce949fd8f18a208e0cda7cff4736f25","first_computed_at":"2026-05-18T00:09:47.291578Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:47.291578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hCV5EGFkjISGckrvw0biICZfVGFNDtTH3rWQvxPSlZo3TX9BuKpf/U3VZTDxjCmvjnvDTvn1Di7PaTfqoFY2Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:47.292119Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.09505","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e68f1e9a58d9541e0eb8eccea4dc345028dbee376e88ddbc62897d1674a9a52","sha256:03d1693de66d0f79b26bad167363c25d3f368ad6ef66d6d67f5201c8c9e880f8"],"state_sha256":"467a2e8e3e4290c4861600dd8c2cab43a66ca0768be1922547437ae23a815231"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p4ehmLE+mZ/nG1c+hVh6f76tobbUArHFdJ/uchuGuhdwz5Z2Y/2gDNbxnE+D+GwaIczmxjd36Z66P1dS436cDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:04:55.636059Z","bundle_sha256":"d6ec155ab773c9a7b96e250e851110f218db86827845e3b8b381504268950af5"}}