{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:SFA2JCKBXF6QFCXIV43GWFMFSN","short_pith_number":"pith:SFA2JCKB","schema_version":"1.0","canonical_sha256":"9141a48941b97d028ae8af366b158593426b7e9434a8358dfa1a50c34caaac62","source":{"kind":"arxiv","id":"1211.0729","version":8},"attestation_state":"computed","paper":{"title":"A Simple Algorithm for Computing BOCP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.GR"],"primary_cat":"cs.DS","authors_text":"Jack Wang","submitted_at":"2012-11-04T22:38:11Z","abstract_excerpt":"In this article, we devise a concise algorithm for computing BOCP. Our method is simple, easy-to-implement but without loss of efficiency. Given two circular-arc polygons with $m$ and $n$ edges respectively, our method runs in $O(m+n+(l+k)\\log l)$ time, using $O(m+n+k)$ space, where $k$ is the number of intersections, and $l$ is the number of {edge}s. Our algorithm has the power to approximate to linear complexity when $k$ and $l$ are small. The superiority of the proposed algorithm is also validated through empirical study."},"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":"1211.0729","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-04T22:38:11Z","cross_cats_sorted":["cs.CG","cs.GR"],"title_canon_sha256":"38d7f5aa607d45a9bb861a8a4716c65256c8790ab587a198fe6bfdebaf493fa9","abstract_canon_sha256":"0d24a46726fcd044a513b9c9933dd844070fd7d68393feefd866d6c8f154b77d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:51.272671Z","signature_b64":"Ik8MBrgC2BY0Qyk+/TU5X1f7HBinBr8319sBJlR2SneptpLW1W/cIL3JtbrCnqJ73/7aurW/qqJ/bLFmw9z5DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9141a48941b97d028ae8af366b158593426b7e9434a8358dfa1a50c34caaac62","last_reissued_at":"2026-05-18T00:11:51.271996Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:51.271996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Simple Algorithm for Computing BOCP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.GR"],"primary_cat":"cs.DS","authors_text":"Jack Wang","submitted_at":"2012-11-04T22:38:11Z","abstract_excerpt":"In this article, we devise a concise algorithm for computing BOCP. Our method is simple, easy-to-implement but without loss of efficiency. Given two circular-arc polygons with $m$ and $n$ edges respectively, our method runs in $O(m+n+(l+k)\\log l)$ time, using $O(m+n+k)$ space, where $k$ is the number of intersections, and $l$ is the number of {edge}s. Our algorithm has the power to approximate to linear complexity when $k$ and $l$ are small. The superiority of the proposed algorithm is also validated through empirical study."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.0729","kind":"arxiv","version":8},"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":"1211.0729","created_at":"2026-05-18T00:11:51.272102+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.0729v8","created_at":"2026-05-18T00:11:51.272102+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0729","created_at":"2026-05-18T00:11:51.272102+00:00"},{"alias_kind":"pith_short_12","alias_value":"SFA2JCKBXF6Q","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"SFA2JCKBXF6QFCXI","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"SFA2JCKB","created_at":"2026-05-18T12:27:20.899486+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/SFA2JCKBXF6QFCXIV43GWFMFSN","json":"https://pith.science/pith/SFA2JCKBXF6QFCXIV43GWFMFSN.json","graph_json":"https://pith.science/api/pith-number/SFA2JCKBXF6QFCXIV43GWFMFSN/graph.json","events_json":"https://pith.science/api/pith-number/SFA2JCKBXF6QFCXIV43GWFMFSN/events.json","paper":"https://pith.science/paper/SFA2JCKB"},"agent_actions":{"view_html":"https://pith.science/pith/SFA2JCKBXF6QFCXIV43GWFMFSN","download_json":"https://pith.science/pith/SFA2JCKBXF6QFCXIV43GWFMFSN.json","view_paper":"https://pith.science/paper/SFA2JCKB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.0729&json=true","fetch_graph":"https://pith.science/api/pith-number/SFA2JCKBXF6QFCXIV43GWFMFSN/graph.json","fetch_events":"https://pith.science/api/pith-number/SFA2JCKBXF6QFCXIV43GWFMFSN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SFA2JCKBXF6QFCXIV43GWFMFSN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SFA2JCKBXF6QFCXIV43GWFMFSN/action/storage_attestation","attest_author":"https://pith.science/pith/SFA2JCKBXF6QFCXIV43GWFMFSN/action/author_attestation","sign_citation":"https://pith.science/pith/SFA2JCKBXF6QFCXIV43GWFMFSN/action/citation_signature","submit_replication":"https://pith.science/pith/SFA2JCKBXF6QFCXIV43GWFMFSN/action/replication_record"}},"created_at":"2026-05-18T00:11:51.272102+00:00","updated_at":"2026-05-18T00:11:51.272102+00:00"}