{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:IHARSQT5OSH57232UA5NAXWNIT","short_pith_number":"pith:IHARSQT5","canonical_record":{"source":{"id":"1512.07533","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-12-23T16:33:11Z","cross_cats_sorted":[],"title_canon_sha256":"76570669e058e44cba494fc84064a0edadedbad525925ec5d73ed8367065826a","abstract_canon_sha256":"8b83ac8a011b2ebc33d20760594deddb9247e78f72ddea45ed401615dc95ab70"},"schema_version":"1.0"},"canonical_sha256":"41c119427d748fdfeb7aa03ad05ecd44ed201d60467b59dbb139bc70d68fb37e","source":{"kind":"arxiv","id":"1512.07533","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.07533","created_at":"2026-05-18T01:16:15Z"},{"alias_kind":"arxiv_version","alias_value":"1512.07533v2","created_at":"2026-05-18T01:16:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07533","created_at":"2026-05-18T01:16:15Z"},{"alias_kind":"pith_short_12","alias_value":"IHARSQT5OSH5","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IHARSQT5OSH57232","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IHARSQT5","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:IHARSQT5OSH57232UA5NAXWNIT","target":"record","payload":{"canonical_record":{"source":{"id":"1512.07533","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-12-23T16:33:11Z","cross_cats_sorted":[],"title_canon_sha256":"76570669e058e44cba494fc84064a0edadedbad525925ec5d73ed8367065826a","abstract_canon_sha256":"8b83ac8a011b2ebc33d20760594deddb9247e78f72ddea45ed401615dc95ab70"},"schema_version":"1.0"},"canonical_sha256":"41c119427d748fdfeb7aa03ad05ecd44ed201d60467b59dbb139bc70d68fb37e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:15.035151Z","signature_b64":"2UCr8Ye+7oip4EvJsrE43EcUMe1vIFaA+WXGMONIqBI2qbpNCE8yus9UUaIHeudt6lFGYxx7AktRZuI3aJ4bAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41c119427d748fdfeb7aa03ad05ecd44ed201d60467b59dbb139bc70d68fb37e","last_reissued_at":"2026-05-18T01:16:15.034514Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:15.034514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.07533","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-18T01:16:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9RB+tdHw+bBthZtuxReyonz8SIGMQyBZ9jUpe2ffmtfy1bW4cFphPwLpW4LGHPWY7vrZe/Zj8QAxhiGuWKeaCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:57:40.977242Z"},"content_sha256":"c6d447233aaa8b6111c833f6d0ae80cd3ddbf1e1fb13f63cb0419285531b0ff9","schema_version":"1.0","event_id":"sha256:c6d447233aaa8b6111c833f6d0ae80cd3ddbf1e1fb13f63cb0419285531b0ff9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:IHARSQT5OSH57232UA5NAXWNIT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Geometric k-Center Problems with Centers Constrained to Two Lines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Binay Bhattacharya, Naoki Katoh, Sandip Das, Tsunehiko Kameda, Yuya Higashikawa","submitted_at":"2015-12-23T16:33:11Z","abstract_excerpt":"We consider the $k$-center problem in which the centers are constrained to lie on two lines. Given a set of $n$ weighted points in the plane, we want to locate up to $k$ centers on two parallel lines. We present an $O(n\\log^2 n)$ time algorithm, which minimizes the weighted distance from any point to a center. We then consider the unweighted case, where the centers are constrained to be on two perpendicular lines. Our algorithms run in $O(n\\log^2 n)$ time also in this case."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07533","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-18T01:16:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ed9P4vjCJwF2972q27kRAoRIRNiRFHPAQEPjDO2M3cb+T5rlDwF+QT2GLa4tBJXCr0hO28CLIPdPREy3ziutCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:57:40.977709Z"},"content_sha256":"989ed5d06976b50ec080cee70918a23e30fe5a45426243f1a9833dae2e5f381e","schema_version":"1.0","event_id":"sha256:989ed5d06976b50ec080cee70918a23e30fe5a45426243f1a9833dae2e5f381e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IHARSQT5OSH57232UA5NAXWNIT/bundle.json","state_url":"https://pith.science/pith/IHARSQT5OSH57232UA5NAXWNIT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IHARSQT5OSH57232UA5NAXWNIT/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-25T18:57:40Z","links":{"resolver":"https://pith.science/pith/IHARSQT5OSH57232UA5NAXWNIT","bundle":"https://pith.science/pith/IHARSQT5OSH57232UA5NAXWNIT/bundle.json","state":"https://pith.science/pith/IHARSQT5OSH57232UA5NAXWNIT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IHARSQT5OSH57232UA5NAXWNIT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IHARSQT5OSH57232UA5NAXWNIT","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":"8b83ac8a011b2ebc33d20760594deddb9247e78f72ddea45ed401615dc95ab70","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-12-23T16:33:11Z","title_canon_sha256":"76570669e058e44cba494fc84064a0edadedbad525925ec5d73ed8367065826a"},"schema_version":"1.0","source":{"id":"1512.07533","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.07533","created_at":"2026-05-18T01:16:15Z"},{"alias_kind":"arxiv_version","alias_value":"1512.07533v2","created_at":"2026-05-18T01:16:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07533","created_at":"2026-05-18T01:16:15Z"},{"alias_kind":"pith_short_12","alias_value":"IHARSQT5OSH5","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IHARSQT5OSH57232","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IHARSQT5","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:989ed5d06976b50ec080cee70918a23e30fe5a45426243f1a9833dae2e5f381e","target":"graph","created_at":"2026-05-18T01:16:15Z","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 consider the $k$-center problem in which the centers are constrained to lie on two lines. Given a set of $n$ weighted points in the plane, we want to locate up to $k$ centers on two parallel lines. We present an $O(n\\log^2 n)$ time algorithm, which minimizes the weighted distance from any point to a center. We then consider the unweighted case, where the centers are constrained to be on two perpendicular lines. Our algorithms run in $O(n\\log^2 n)$ time also in this case.","authors_text":"Binay Bhattacharya, Naoki Katoh, Sandip Das, Tsunehiko Kameda, Yuya Higashikawa","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-12-23T16:33:11Z","title":"Geometric k-Center Problems with Centers Constrained to Two Lines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07533","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:c6d447233aaa8b6111c833f6d0ae80cd3ddbf1e1fb13f63cb0419285531b0ff9","target":"record","created_at":"2026-05-18T01:16:15Z","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":"8b83ac8a011b2ebc33d20760594deddb9247e78f72ddea45ed401615dc95ab70","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-12-23T16:33:11Z","title_canon_sha256":"76570669e058e44cba494fc84064a0edadedbad525925ec5d73ed8367065826a"},"schema_version":"1.0","source":{"id":"1512.07533","kind":"arxiv","version":2}},"canonical_sha256":"41c119427d748fdfeb7aa03ad05ecd44ed201d60467b59dbb139bc70d68fb37e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41c119427d748fdfeb7aa03ad05ecd44ed201d60467b59dbb139bc70d68fb37e","first_computed_at":"2026-05-18T01:16:15.034514Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:15.034514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2UCr8Ye+7oip4EvJsrE43EcUMe1vIFaA+WXGMONIqBI2qbpNCE8yus9UUaIHeudt6lFGYxx7AktRZuI3aJ4bAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:15.035151Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.07533","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6d447233aaa8b6111c833f6d0ae80cd3ddbf1e1fb13f63cb0419285531b0ff9","sha256:989ed5d06976b50ec080cee70918a23e30fe5a45426243f1a9833dae2e5f381e"],"state_sha256":"1b80e93b7ce408867af374ae90ba0c4cfbc63a4d0c1d55ff0097a5a87d2cd588"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FOmWbR9EQWHVNAs3DVstJjjTmbswvfpnSuK/DhkCPKc0U2e2AD8pK58rXeZOtIujoe4L6IYIEqRxN14zQ1J4DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:57:40.981915Z","bundle_sha256":"90c41bc458262afd60330b5d269c3ee2a8e4606dcd9d16231ccebcabce65cd26"}}