{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:VMAMO7GKREI6EM54QRMUCH5UPB","short_pith_number":"pith:VMAMO7GK","schema_version":"1.0","canonical_sha256":"ab00c77cca8911e233bc8459411fb4785c19adaeccf2646fcb2f7fda57f5248a","source":{"kind":"arxiv","id":"1307.5612","version":2},"attestation_state":"computed","paper":{"title":"Efficient Range Reporting of Convex Hull","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Jatin Agarwal, Kannan Srinathan, Kishore Kothapalli, Nadeem Moidu","submitted_at":"2013-07-22T07:49:57Z","abstract_excerpt":"We consider the problem of reporting convex hull points in an orthogonal range query in two dimensions. Formally, let $P$ be a set of $n$ points in $\\mathbb{R}^{2}$. A point lies on the convex hull of a point set $S$ if it lies on the boundary of the minimum convex polygon formed by $S$. In this paper, we are interested in finding the points that lie on the boundary of the convex hull of the points in $P$ that also fall with in an orthogonal range$[x_{lt},x_{rt}]\\times{}[y_b, y_t]$. We propose a $O(n \\log^{2} n) $ space data structure that can support reporting points on a convex hull inside a"},"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":"1307.5612","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-07-22T07:49:57Z","cross_cats_sorted":[],"title_canon_sha256":"cec4f8e35c391a6d42e5e40e74a05fede4388ae5cc171255a38c09db8bfe150d","abstract_canon_sha256":"6c43e1b949e8cbeb810f14d86a25669d11de78755886796d57abb98f7cce045d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:46.021088Z","signature_b64":"RDafSZSvy214hcQj/WyugRY4pEBiGZsAxjlVPTvbrLdl0iOSHBXXg0LpmacyfWG0kxKIyzi51igRLMkGCkEfBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab00c77cca8911e233bc8459411fb4785c19adaeccf2646fcb2f7fda57f5248a","last_reissued_at":"2026-05-18T03:17:46.020455Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:46.020455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Range Reporting of Convex Hull","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Jatin Agarwal, Kannan Srinathan, Kishore Kothapalli, Nadeem Moidu","submitted_at":"2013-07-22T07:49:57Z","abstract_excerpt":"We consider the problem of reporting convex hull points in an orthogonal range query in two dimensions. Formally, let $P$ be a set of $n$ points in $\\mathbb{R}^{2}$. A point lies on the convex hull of a point set $S$ if it lies on the boundary of the minimum convex polygon formed by $S$. In this paper, we are interested in finding the points that lie on the boundary of the convex hull of the points in $P$ that also fall with in an orthogonal range$[x_{lt},x_{rt}]\\times{}[y_b, y_t]$. We propose a $O(n \\log^{2} n) $ space data structure that can support reporting points on a convex hull inside a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5612","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":"1307.5612","created_at":"2026-05-18T03:17:46.020549+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.5612v2","created_at":"2026-05-18T03:17:46.020549+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5612","created_at":"2026-05-18T03:17:46.020549+00:00"},{"alias_kind":"pith_short_12","alias_value":"VMAMO7GKREI6","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"VMAMO7GKREI6EM54","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"VMAMO7GK","created_at":"2026-05-18T12:28:04.890932+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/VMAMO7GKREI6EM54QRMUCH5UPB","json":"https://pith.science/pith/VMAMO7GKREI6EM54QRMUCH5UPB.json","graph_json":"https://pith.science/api/pith-number/VMAMO7GKREI6EM54QRMUCH5UPB/graph.json","events_json":"https://pith.science/api/pith-number/VMAMO7GKREI6EM54QRMUCH5UPB/events.json","paper":"https://pith.science/paper/VMAMO7GK"},"agent_actions":{"view_html":"https://pith.science/pith/VMAMO7GKREI6EM54QRMUCH5UPB","download_json":"https://pith.science/pith/VMAMO7GKREI6EM54QRMUCH5UPB.json","view_paper":"https://pith.science/paper/VMAMO7GK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.5612&json=true","fetch_graph":"https://pith.science/api/pith-number/VMAMO7GKREI6EM54QRMUCH5UPB/graph.json","fetch_events":"https://pith.science/api/pith-number/VMAMO7GKREI6EM54QRMUCH5UPB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VMAMO7GKREI6EM54QRMUCH5UPB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VMAMO7GKREI6EM54QRMUCH5UPB/action/storage_attestation","attest_author":"https://pith.science/pith/VMAMO7GKREI6EM54QRMUCH5UPB/action/author_attestation","sign_citation":"https://pith.science/pith/VMAMO7GKREI6EM54QRMUCH5UPB/action/citation_signature","submit_replication":"https://pith.science/pith/VMAMO7GKREI6EM54QRMUCH5UPB/action/replication_record"}},"created_at":"2026-05-18T03:17:46.020549+00:00","updated_at":"2026-05-18T03:17:46.020549+00:00"}