{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:Q7WIBOGRAOU5TARSU2H6P3GQ43","short_pith_number":"pith:Q7WIBOGR","schema_version":"1.0","canonical_sha256":"87ec80b8d103a9d98232a68fe7ecd0e6de0af8efcbbee2817c90a7a5f5eab781","source":{"kind":"arxiv","id":"1809.00116","version":1},"attestation_state":"computed","paper":{"title":"On Triangluar Separation of Bichromatic Point Sets in Polygonal Environment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Farnaz Sheikhi, Sharareh Alipour","submitted_at":"2018-09-01T05:23:55Z","abstract_excerpt":"Let $\\mathcal P$ be a simple polygonal environment with $k$ vertices in the plane. Assume that a set $B$ of $b$ blue points and a set $R$ of $r$ red points are distributed in $\\mathcal P$. We study the problem of computing triangles that separate the sets $B$ and $R$, and fall in $\\mathcal P$. We call these triangles \\emph{inscribed triangular separators}. We propose an output-sensitive algorithm to solve this problem in $O(r \\cdot (r+c_B+k)+h_\\triangle)$ time, where $c_B$ is the size of convex hull of $B$, and $h_\\triangle$ is the number of inscribed triangular separators. We also study the c"},"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":"1809.00116","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-09-01T05:23:55Z","cross_cats_sorted":[],"title_canon_sha256":"230daea63218fab67b9807ed6a7d41774fefc0320aecbb530cf7050aa6f645ec","abstract_canon_sha256":"7c571fb14276e3cfcb9b51bcea35c2e74db944681741b0d773b7d5f9f4b41bd3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:36.066961Z","signature_b64":"0hyOwbROFopIc3F00spHGJgxQnq1wkq3p4PKqKveSzO+rEVEYrAjd68byjx9cnNPYp/WdsFWMZ0/Dsva0QTSCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87ec80b8d103a9d98232a68fe7ecd0e6de0af8efcbbee2817c90a7a5f5eab781","last_reissued_at":"2026-05-18T00:06:36.066504Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:36.066504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Triangluar Separation of Bichromatic Point Sets in Polygonal Environment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Farnaz Sheikhi, Sharareh Alipour","submitted_at":"2018-09-01T05:23:55Z","abstract_excerpt":"Let $\\mathcal P$ be a simple polygonal environment with $k$ vertices in the plane. Assume that a set $B$ of $b$ blue points and a set $R$ of $r$ red points are distributed in $\\mathcal P$. We study the problem of computing triangles that separate the sets $B$ and $R$, and fall in $\\mathcal P$. We call these triangles \\emph{inscribed triangular separators}. We propose an output-sensitive algorithm to solve this problem in $O(r \\cdot (r+c_B+k)+h_\\triangle)$ time, where $c_B$ is the size of convex hull of $B$, and $h_\\triangle$ is the number of inscribed triangular separators. We also study the c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.00116","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":"1809.00116","created_at":"2026-05-18T00:06:36.066576+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.00116v1","created_at":"2026-05-18T00:06:36.066576+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.00116","created_at":"2026-05-18T00:06:36.066576+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q7WIBOGRAOU5","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q7WIBOGRAOU5TARS","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q7WIBOGR","created_at":"2026-05-18T12:32:46.962924+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/Q7WIBOGRAOU5TARSU2H6P3GQ43","json":"https://pith.science/pith/Q7WIBOGRAOU5TARSU2H6P3GQ43.json","graph_json":"https://pith.science/api/pith-number/Q7WIBOGRAOU5TARSU2H6P3GQ43/graph.json","events_json":"https://pith.science/api/pith-number/Q7WIBOGRAOU5TARSU2H6P3GQ43/events.json","paper":"https://pith.science/paper/Q7WIBOGR"},"agent_actions":{"view_html":"https://pith.science/pith/Q7WIBOGRAOU5TARSU2H6P3GQ43","download_json":"https://pith.science/pith/Q7WIBOGRAOU5TARSU2H6P3GQ43.json","view_paper":"https://pith.science/paper/Q7WIBOGR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.00116&json=true","fetch_graph":"https://pith.science/api/pith-number/Q7WIBOGRAOU5TARSU2H6P3GQ43/graph.json","fetch_events":"https://pith.science/api/pith-number/Q7WIBOGRAOU5TARSU2H6P3GQ43/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q7WIBOGRAOU5TARSU2H6P3GQ43/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q7WIBOGRAOU5TARSU2H6P3GQ43/action/storage_attestation","attest_author":"https://pith.science/pith/Q7WIBOGRAOU5TARSU2H6P3GQ43/action/author_attestation","sign_citation":"https://pith.science/pith/Q7WIBOGRAOU5TARSU2H6P3GQ43/action/citation_signature","submit_replication":"https://pith.science/pith/Q7WIBOGRAOU5TARSU2H6P3GQ43/action/replication_record"}},"created_at":"2026-05-18T00:06:36.066576+00:00","updated_at":"2026-05-18T00:06:36.066576+00:00"}