{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:O5JRYVAYDKWQE5EJBHS5MUKMXH","short_pith_number":"pith:O5JRYVAY","schema_version":"1.0","canonical_sha256":"77531c54181aad02748909e5d6514cb9c0afc0db3759e17546f3476b02e49bad","source":{"kind":"arxiv","id":"1810.07346","version":3},"attestation_state":"computed","paper":{"title":"Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Bahman Kalantari, Yikai Zhang","submitted_at":"2018-10-17T01:36:01Z","abstract_excerpt":"The it Convex Hull Membership(CHM) problem is: Given a point $p$ and a subset $S$ of $n$ points in $\\mathbb{R}^m$, is $p \\in conv(S)$? CHM is not only a fundamental problem in Linear Programming, Computational Geometry, Machine Learning and Statistics, it also serves as a query problem in many applications e.g. Topic Modeling, LP Feasibility, Data Reduction. The {\\it Triangle Algorithm} (TA) \\cite{kalantari2015characterization} either computes an approximate solution in the convex hull, or a separating hyperplane. The {\\it Spherical}-CHM is a CHM, where $p=0$ and each point in $S$ has unit nor"},"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":"1810.07346","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-10-17T01:36:01Z","cross_cats_sorted":[],"title_canon_sha256":"15f28589bba93efc11d119aed504d284a2c802c2ddfefd6ea6e0c3b83280343e","abstract_canon_sha256":"4e22e4682b6b20e6285e0836f8b01cd54ef21ac04a30e5865d33dda79f715bd6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:11:21.865094Z","signature_b64":"Vq3fsbqtmMQDYqky8ots3thzv2+G++baEbuUuNryAZSSOkEh0/HKV7UTuQ8eowd/OXchuLaXQUqa44e2A6XqCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77531c54181aad02748909e5d6514cb9c0afc0db3759e17546f3476b02e49bad","last_reissued_at":"2026-07-05T03:11:21.864604Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:11:21.864604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Bahman Kalantari, Yikai Zhang","submitted_at":"2018-10-17T01:36:01Z","abstract_excerpt":"The it Convex Hull Membership(CHM) problem is: Given a point $p$ and a subset $S$ of $n$ points in $\\mathbb{R}^m$, is $p \\in conv(S)$? CHM is not only a fundamental problem in Linear Programming, Computational Geometry, Machine Learning and Statistics, it also serves as a query problem in many applications e.g. Topic Modeling, LP Feasibility, Data Reduction. The {\\it Triangle Algorithm} (TA) \\cite{kalantari2015characterization} either computes an approximate solution in the convex hull, or a separating hyperplane. The {\\it Spherical}-CHM is a CHM, where $p=0$ and each point in $S$ has unit nor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07346","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1810.07346/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1810.07346","created_at":"2026-07-05T03:11:21.864665+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.07346v3","created_at":"2026-07-05T03:11:21.864665+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07346","created_at":"2026-07-05T03:11:21.864665+00:00"},{"alias_kind":"pith_short_12","alias_value":"O5JRYVAYDKWQ","created_at":"2026-07-05T03:11:21.864665+00:00"},{"alias_kind":"pith_short_16","alias_value":"O5JRYVAYDKWQE5EJ","created_at":"2026-07-05T03:11:21.864665+00:00"},{"alias_kind":"pith_short_8","alias_value":"O5JRYVAY","created_at":"2026-07-05T03:11:21.864665+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/O5JRYVAYDKWQE5EJBHS5MUKMXH","json":"https://pith.science/pith/O5JRYVAYDKWQE5EJBHS5MUKMXH.json","graph_json":"https://pith.science/api/pith-number/O5JRYVAYDKWQE5EJBHS5MUKMXH/graph.json","events_json":"https://pith.science/api/pith-number/O5JRYVAYDKWQE5EJBHS5MUKMXH/events.json","paper":"https://pith.science/paper/O5JRYVAY"},"agent_actions":{"view_html":"https://pith.science/pith/O5JRYVAYDKWQE5EJBHS5MUKMXH","download_json":"https://pith.science/pith/O5JRYVAYDKWQE5EJBHS5MUKMXH.json","view_paper":"https://pith.science/paper/O5JRYVAY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.07346&json=true","fetch_graph":"https://pith.science/api/pith-number/O5JRYVAYDKWQE5EJBHS5MUKMXH/graph.json","fetch_events":"https://pith.science/api/pith-number/O5JRYVAYDKWQE5EJBHS5MUKMXH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O5JRYVAYDKWQE5EJBHS5MUKMXH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O5JRYVAYDKWQE5EJBHS5MUKMXH/action/storage_attestation","attest_author":"https://pith.science/pith/O5JRYVAYDKWQE5EJBHS5MUKMXH/action/author_attestation","sign_citation":"https://pith.science/pith/O5JRYVAYDKWQE5EJBHS5MUKMXH/action/citation_signature","submit_replication":"https://pith.science/pith/O5JRYVAYDKWQE5EJBHS5MUKMXH/action/replication_record"}},"created_at":"2026-07-05T03:11:21.864665+00:00","updated_at":"2026-07-05T03:11:21.864665+00:00"}