{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VBNMRLOPUBJGR5YMDHXTQR6LGI","short_pith_number":"pith:VBNMRLOP","schema_version":"1.0","canonical_sha256":"a85ac8adcfa05268f70c19ef3847cb3207fe0cbd39b4696e4a661f239af4bfbd","source":{"kind":"arxiv","id":"1509.05377","version":1},"attestation_state":"computed","paper":{"title":"Computing the Rectilinear Center of Uncertain Points in the Plane","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Haitao Wang, Jingru Zhang","submitted_at":"2015-09-17T19:14:43Z","abstract_excerpt":"In this paper, we consider the rectilinear one-center problem on uncertain points in the plane. In this problem, we are given a set $P$ of $n$ (weighted) uncertain points in the plane and each uncertain point has $m$ possible locations each associated with a probability for the point appearing at that location. The goal is to find a point $q^*$ in the plane which minimizes the maximum expected rectilinear distance from $q^*$ to all uncertain points of $P$, and $q^*$ is called a rectilinear center. We present an algorithm that solves the problem in $O(mn)$ time. Since the input size of the prob"},"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":"1509.05377","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-09-17T19:14:43Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"faff54b7861d5f43aa52a5523da4f812f754f4ca89a094c9c07f0fc5b596f224","abstract_canon_sha256":"82d150a91b0417df873e260a05b5f6d21943521b01817652de42e98b96a3f60a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:44.076433Z","signature_b64":"c/TOApRzrBnDeWGX1QEd+BgYJV99Q3HiThk5SRJATQxnovsk6U6AK23ZOKkqOm6Xiba3H9zCawUSrAYVFReuAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a85ac8adcfa05268f70c19ef3847cb3207fe0cbd39b4696e4a661f239af4bfbd","last_reissued_at":"2026-05-18T01:32:44.075917Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:44.075917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing the Rectilinear Center of Uncertain Points in the Plane","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Haitao Wang, Jingru Zhang","submitted_at":"2015-09-17T19:14:43Z","abstract_excerpt":"In this paper, we consider the rectilinear one-center problem on uncertain points in the plane. In this problem, we are given a set $P$ of $n$ (weighted) uncertain points in the plane and each uncertain point has $m$ possible locations each associated with a probability for the point appearing at that location. The goal is to find a point $q^*$ in the plane which minimizes the maximum expected rectilinear distance from $q^*$ to all uncertain points of $P$, and $q^*$ is called a rectilinear center. We present an algorithm that solves the problem in $O(mn)$ time. Since the input size of the prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05377","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":"1509.05377","created_at":"2026-05-18T01:32:44.076013+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.05377v1","created_at":"2026-05-18T01:32:44.076013+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05377","created_at":"2026-05-18T01:32:44.076013+00:00"},{"alias_kind":"pith_short_12","alias_value":"VBNMRLOPUBJG","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"VBNMRLOPUBJGR5YM","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"VBNMRLOP","created_at":"2026-05-18T12:29:44.643036+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/VBNMRLOPUBJGR5YMDHXTQR6LGI","json":"https://pith.science/pith/VBNMRLOPUBJGR5YMDHXTQR6LGI.json","graph_json":"https://pith.science/api/pith-number/VBNMRLOPUBJGR5YMDHXTQR6LGI/graph.json","events_json":"https://pith.science/api/pith-number/VBNMRLOPUBJGR5YMDHXTQR6LGI/events.json","paper":"https://pith.science/paper/VBNMRLOP"},"agent_actions":{"view_html":"https://pith.science/pith/VBNMRLOPUBJGR5YMDHXTQR6LGI","download_json":"https://pith.science/pith/VBNMRLOPUBJGR5YMDHXTQR6LGI.json","view_paper":"https://pith.science/paper/VBNMRLOP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.05377&json=true","fetch_graph":"https://pith.science/api/pith-number/VBNMRLOPUBJGR5YMDHXTQR6LGI/graph.json","fetch_events":"https://pith.science/api/pith-number/VBNMRLOPUBJGR5YMDHXTQR6LGI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VBNMRLOPUBJGR5YMDHXTQR6LGI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VBNMRLOPUBJGR5YMDHXTQR6LGI/action/storage_attestation","attest_author":"https://pith.science/pith/VBNMRLOPUBJGR5YMDHXTQR6LGI/action/author_attestation","sign_citation":"https://pith.science/pith/VBNMRLOPUBJGR5YMDHXTQR6LGI/action/citation_signature","submit_replication":"https://pith.science/pith/VBNMRLOPUBJGR5YMDHXTQR6LGI/action/replication_record"}},"created_at":"2026-05-18T01:32:44.076013+00:00","updated_at":"2026-05-18T01:32:44.076013+00:00"}